update: 添加问题“3024.三角形类型”的代码和题解(#943)

LetMeFly666 · web-flow · commit b136d5af05b1 · 2025-05-19T13:42:51.000+08:00
* 3024: WA.cpp (#942) 三角形两边之和必须大于第三边。。。 不是大于等于 Signed-off-by: LetMeFly666 <814114971@qq.com> * 3024: AC.cpp+Py | Test.java (#942) Signed-off-by: LetMeFly666 <814114971@qq.com> * update: 添加问题“3024.三角形类型”的代码和题解(#943) Signed-off-by: LetMeFly666 <814114971@qq.com> --------- Signed-off-by: LetMeFly666 <814114971@qq.com>
diff --git a/Codes/3024-type-of-triangle.cpp b/Codes/3024-type-of-triangle.cpp
@@ -0,0 +1,26 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-19 13:22:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-19 13:28:44
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    string triangleType(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        if (nums[0] + nums[1] <= nums[2]) {
+            return "none";
+        }
+        if (nums[0] == nums[1] && nums[1] == nums[2]) {
+            return "equilateral";
+        }
+        if (nums[0] == nums[1] || nums[1] == nums[2]) {
+            return "isosceles";
+        }
+        return "scalene";
+    }
+};
diff --git a/Codes/3024-type-of-triangle.go b/Codes/3024-type-of-triangle.go
@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-19 13:22:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-19 13:35:48
+ */
+package main
+
+import "sort"
+
+func triangleType(nums []int) string {
+    sort.Ints(nums)
+    if nums[0] + nums[1] <= nums[2] {
+        return "none"
+    }
+    if nums[0] == nums[1] && nums[1] == nums[2] {
+        return "equilateral"
+    }
+    if nums[0] == nums[1] || nums[1] == nums[2] {
+        return "isosceles"
+    }
+    return "scalene"
+}
diff --git a/Codes/3024-type-of-triangle.java b/Codes/3024-type-of-triangle.java
@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-19 13:22:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-19 13:32:46
+ */
+import java.util.Arrays;
+
+class Solution {
+    public String triangleType(int[] nums) {
+        Arrays.sort(nums);
+        if (nums[0] + nums[1] <= nums[2]) {
+            return "none";
+        }
+        if (nums[0] == nums[1] && nums[1] == nums[2]) {
+            return "equilateral";
+        }
+        if (nums[0] == nums[1] || nums[1] == nums[2]) {
+            return "isosceles";
+        }
+        return "scalene";
+    }
+}
diff --git a/Codes/3024-type-of-triangle.py b/Codes/3024-type-of-triangle.py
@@ -0,0 +1,19 @@
+'''
+Author: LetMeFly
+Date: 2025-05-19 13:22:46
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-05-19 13:30:25
+'''
+from typing import List
+
+class Solution:
+    def triangleType(self, nums: List[int]) -> str:
+        nums.sort()
+        a, b, c = nums
+        if a + b <= c:
+            return "none"
+        if a == b == c:
+            return "equilateral"
+        if a == b or b == c:
+            return "isosceles"
+        return "scalene"
diff --git a/README.md b/README.md
@@ -890,6 +890,7 @@
 |2999.统计强大整数的数目|困难|<a href="https://leetcode.cn/problems/count-the-number-of-powerful-integers/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/12/LeetCode%202999.%E7%BB%9F%E8%AE%A1%E5%BC%BA%E5%A4%A7%E6%95%B4%E6%95%B0%E7%9A%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147191672" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-the-number-of-powerful-integers/solutions/3649695/letmefly-2999tong-ji-qiang-da-zheng-shu-jnya8/" target="_blank">LeetCode题解</a>|
 |3011.判断一个数组是否可以变为有序|中等|<a href="https://leetcode.cn/problems/find-if-array-can-be-sorted/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/07/13/LeetCode%203011.%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E6%95%B0%E7%BB%84%E6%98%AF%E5%90%A6%E5%8F%AF%E4%BB%A5%E5%8F%98%E4%B8%BA%E6%9C%89%E5%BA%8F/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/140391465" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-if-array-can-be-sorted/solutions/2841665/letmefly-3011pan-duan-yi-ge-shu-zu-shi-f-i9ck/" target="_blank">LeetCode题解</a>|
 |3019.按键变更的次数|简单|<a href="https://leetcode.cn/problems/number-of-changing-keys/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/07/LeetCode%203019.%E6%8C%89%E9%94%AE%E5%8F%98%E6%9B%B4%E7%9A%84%E6%AC%A1%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144983704" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/number-of-changing-keys/solutions/3040949/letmefly-3019an-jian-bian-geng-de-ci-shu-pgzx/" target="_blank">LeetCode题解</a>|
+|3024.三角形类型|简单|<a href="https://leetcode.cn/problems/type-of-triangle/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/05/19/LeetCode%203024.%E4%B8%89%E8%A7%92%E5%BD%A2%E7%B1%BB%E5%9E%8B/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148061722" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/type-of-triangle/solutions/3680826/letmefly-3024san-jiao-xing-lei-xing-shou-q46h/" target="_blank">LeetCode题解</a>|
 |3033.修改矩阵|简单|<a href="https://leetcode.cn/problems/modify-the-matrix/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/07/05/LeetCode%203033.%E4%BF%AE%E6%94%B9%E7%9F%A9%E9%98%B5/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/140219034" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/modify-the-matrix/solutions/2832430/letmefly-3033xiu-gai-ju-zhen-yuan-di-xiu-e0cy/" target="_blank">LeetCode题解</a>|
 |3038.相同分数的最大操作数目I|简单|<a href="https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/06/07/LeetCode%203038.%E7%9B%B8%E5%90%8C%E5%88%86%E6%95%B0%E7%9A%84%E6%9C%80%E5%A4%A7%E6%93%8D%E4%BD%9C%E6%95%B0%E7%9B%AEI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/139535702" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-i/solutions/2804245/letmefly-3038xiang-tong-fen-shu-de-zui-d-dkj7/" target="_blank">LeetCode题解</a>|
 |3046.分割数组|简单|<a href="https://leetcode.cn/problems/split-the-array/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/28/LeetCode%203046.%E5%88%86%E5%89%B2%E6%95%B0%E7%BB%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144789679" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/split-the-array/solutions/3032725/letmefly-3046fen-ge-shu-zu-ji-shu-by-tis-33vv/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 3024.三角形类型.md b/Solutions/LeetCode 3024.三角形类型.md
@@ -0,0 +1,178 @@
+---
+title: 3024.三角形类：手速题
+date: 2025-05-19 13:36:41
+tags: [题解, LeetCode, 简单, 数组, 数学, 排序]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】3024.三角形类型：手速题
+
+力扣题目链接：[https://leetcode.cn/problems/type-of-triangle/](https://leetcode.cn/problems/type-of-triangle/)
+
+<p>给你一个下标从 <strong>0</strong>&nbsp;开始长度为 <code>3</code>&nbsp;的整数数组&nbsp;<code>nums</code>&nbsp;，需要用它们来构造三角形。</p>
+
+<ul>
+	<li>如果一个三角形的所有边长度相等，那么这个三角形称为&nbsp;<strong>equilateral</strong>&nbsp;。</li>
+	<li>如果一个三角形恰好有两条边长度相等，那么这个三角形称为&nbsp;<strong>isosceles</strong>&nbsp;。</li>
+	<li>如果一个三角形三条边的长度互不相同，那么这个三角形称为&nbsp;<strong>scalene</strong>&nbsp;。</li>
+</ul>
+
+<p>如果这个数组无法构成一个三角形，请你返回字符串&nbsp;<code>"none"</code>&nbsp;，否则返回一个字符串表示这个三角形的类型。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<b>输入：</b>nums = [3,3,3]
+<b>输出：</b>"equilateral"
+<b>解释：</b>由于三条边长度相等，所以可以构成一个等边三角形，返回 "equilateral" 。
+</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<b>输入：</b>nums = [3,4,5]
+<b>输出：</b>"scalene"
+<b>解释：</b>
+nums[0] + nums[1] = 3 + 4 = 7 ，大于 nums[2] = 5 <span style="text-wrap: wrap;">。</span>
+nums[0] + nums[2] = 3 + 5 = 8 ，大于 nums[1] = 4 。
+nums[1] + nums[2] = 4 + 5 = 9 ，大于 nums[0] = 3 。
+由于任意两边之和都大于第三边，所以可以构成一个三角形，因为三条边的长度互不相等，所以返回 "scalene"。
+</pre>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>nums.length == 3</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
+</ul>
+
+
+    
+## 解题方法：if-else
+
+为了判断给定三个变长是否满足三角形的基本性质（以及是否有两边等长），可以先将三个数从小到大排个序。
+
++ 如果两边之和小于等于第三边则不能构成三角形
++ 如果三边全相等则为正三角形
++ 如果有任何两边相等则为等腰三角形
++ 否则为普通三角形
+
+以上。
+
++ 时间复杂度$O(1)$
++ 空间复杂度$O(1)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-19 13:22:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-19 13:28:44
+ */
+class Solution {
+public:
+    string triangleType(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        if (nums[0] + nums[1] <= nums[2]) {
+            return "none";
+        }
+        if (nums[0] == nums[1] && nums[1] == nums[2]) {
+            return "equilateral";
+        }
+        if (nums[0] == nums[1] || nums[1] == nums[2]) {
+            return "isosceles";
+        }
+        return "scalene";
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-05-19 13:22:46
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-05-19 13:30:25
+'''
+from typing import List
+
+class Solution:
+    def triangleType(self, nums: List[int]) -> str:
+        nums.sort()
+        a, b, c = nums
+        if a + b <= c:
+            return "none"
+        if a == b == c:
+            return "equilateral"
+        if a == b or b == c:
+            return "isosceles"
+        return "scalene"
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-19 13:22:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-19 13:32:46
+ */
+import java.util.Arrays;
+
+class Solution {
+    public String triangleType(int[] nums) {
+        Arrays.sort(nums);
+        if (nums[0] + nums[1] <= nums[2]) {
+            return "none";
+        }
+        if (nums[0] == nums[1] && nums[1] == nums[2]) {
+            return "equilateral";
+        }
+        if (nums[0] == nums[1] || nums[1] == nums[2]) {
+            return "isosceles";
+        }
+        return "scalene";
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-05-19 13:22:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-19 13:35:48
+ */
+package main
+
+import "sort"
+
+func triangleType(nums []int) string {
+    sort.Ints(nums)
+    if nums[0] + nums[1] <= nums[2] {
+        return "none"
+    }
+    if nums[0] == nums[1] && nums[1] == nums[2] {
+        return "equilateral"
+    }
+    if nums[0] == nums[1] || nums[1] == nums[2] {
+        return "isosceles"
+    }
+    return "scalene"
+}
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/148061722)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/05/19/LeetCode%203024.%E4%B8%89%E8%A7%92%E5%BD%A2%E7%B1%BB%E5%9E%8B/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
@@ -1157,6 +1157,17 @@ categories: [自用]
 |masculine|adj. 男人的，像男人的，阳性的<br/>n. 阳性|
 |liability|n. 责任，义务，不利因素，欠债，负债，可能性|
 |tactics|n. 战术，策略|
+|||
+|circumference|n. 圆周，圆周长|
+|apprize|v. 通知，报告<details><summary>例句</summary>He asked a real estate agent to <font color="#28bea0">apprize</font> the house.<br/>他请一名房产中介来评估房子。</details>|
+|intimation|n. 暗示，透漏，间接表示|
+|||
+|pope|n. 教皇|
+|||
+|amends|n. 赔偿，赎罪，复原|
+|twilight|n. 暮色，黄昏，没落时期，衰退期<br/>adj. 奇妙神秘的，虚幻的，朦胧的，界限不清的|
+|||
+|ascertain|v. 查明，弄清|
 
 <p class="wordCounts">单词收录总数</p>
 
diff --git a/Solutions/Other-Japanese-LearningNotes.md b/Solutions/Other-Japanese-LearningNotes.md
@@ -278,6 +278,7 @@ xx型
 |塩(しお)|盐|
 |醬油(しょうゆ)|酱油|
 |砂糖(さとう)|糖|
+|綿飴(わたあめ)|棉花糖|
 |ミント|薄荷|
 |コーヒー|咖啡|
 |カレー|咖喱|
@@ -413,6 +414,7 @@ xx型
 |茶碗(ちゃわん)|碗|
 |お金(おかね)|钱|
 |財布(さいふ)|钱包|
+|パスワード|密码|
 |時計(とけい)|时钟|
 |腕時計(うでどけい)|手表|
 |ベッド|床|
@@ -475,6 +477,7 @@ xx型
 |切手(きって)|邮票|
 |あめ|糖|
 |せっけん|香皂|
+|ハンドジェル|洗手液|
 |ダイヤモンド|钻石|
 |エレベーター|电梯|
 |階段(かいだん)|楼梯|
@@ -693,6 +696,7 @@ xx型
 |とり|鸟|
 |猫(ねこ)|猫|
 |犬(いぬ)|狗|
+|兎(うさぎ)|兔子|
 |ペット|宠物|
 |サル|猴子|
 |キリン|长颈鹿|
@@ -786,6 +790,7 @@ xx型
 |だれ|谁|
 |彼女(かのじょ)|她/女朋友|
 |彼氏(かれし)|男朋友|
+|ルームメイト|室友|
 |女(おんな)|女的|
 |女の子(こ)|女孩|
 |男(おとこ)|男的|
diff --git a/tryGoPy/MGJW/nextweek/chat.md b/tryGoPy/MGJW/nextweek/chat.md
@@ -0,0 +1,7 @@
+<!--
+ * @Author: LetMeFly
+ * @Date: 2025-05-18 16:58:47
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-18 16:58:49
+-->
+通过文字隐蔽传输信息的方式
diff --git a/tryGoPy/MGJW/nextweek/todo.md b/tryGoPy/MGJW/nextweek/todo.md
@@ -0,0 +1,15 @@
+<!--
+ * @Author: LetMeFly
+ * @Date: 2025-05-18 16:33:56
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-18 16:58:37
+-->
+先找找有没有通过文字隐蔽传输的方式
+
+针对性只能要求应用
+建议泛化方法
+
+可以支持图片xx进行泛化，但至少必须支持文字
+
+
+例如使用两张“一摸一样”的表情包diff进行编码
diff --git a/tryGoPy/MGJW/thisWeek/chat.md b/tryGoPy/MGJW/thisWeek/chat.md
@@ -0,0 +1,25 @@
+<!--
+ * @Author: LetMeFly
+ * @Date: 2025-05-18 15:14:16
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-05-18 15:17:50
+-->
+---
+
+chat:
+
+很棒，以报告的口吻描述
+注意要使用段落式，不要列表的一二三
+背景：我是一个研究生，要开组会写报告。尽量不要过于官方的口吻。
+
+
+
+微信服务器保存消息时间有限，但本地多久之前的消息都可以转发。
+A和B准备使用这一机制隐蔽传输信息，要求第三方无法发现这里面的猫腻，只有A和B可以知道。
+打开你的脑洞进行设计和论证
+
+
+
+也可以根据消息diff
+
+
diff --git a/tryGoPy/MGJW/thisWeek/周报.md b/tryGoPy/MGJW/thisWeek/周报.md
