update: 添加问题“976.三角形的最大周长”的代码和题解 (#1150)

0976: AC.cpp+py+java+go+rust (#1149)

cpp - AC,58.29%,26.60%
rust - AC,-%,100.00%
java - AC,96.37%,99.05%
go - AC,47.06%,100.00%
py - AC,34.41%,25.76%

Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

#include <iostream>.cpp

@@ -1,3 +1,7 @@
-cpp - AC,33.52%,100.00%
-py - AC,62.32%,81.16%
-py - AC,py-oneline,86.23%,45.65%
+0976: AC.cpp+py+java+go+rust (#1149)
+
+cpp - AC,58.29%,26.60%
+rust - AC,-%,100.00%
+java - AC,96.37%,99.05%
+go - AC,47.06%,100.00%
+py - AC,34.41%,25.76%

.commitmsg

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-28 13:21:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-28 13:22:32
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int largestPerimeter(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        for (int i = nums.size() - 3; i >= 0; i--) {
+            if (nums[i] + nums[i + 1] > nums[i + 2]) {
+                return nums[i] + nums[i + 1] + nums[i + 2];
+            }
+        }
+        return 0;
+    }
+};

Codes/0976-largest-perimeter-triangle.cpp

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-28 13:21:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-28 13:29:34
+ */
+package main
+
+import "sort"
+
+func largestPerimeter(nums []int) int {
+    sort.Ints(nums)
+    for i := len(nums) - 3; i >= 0; i-- {
+        if nums[i] + nums[i + 1] > nums[i + 2] {
+            return nums[i] + nums[i + 1] + nums[i + 2]
+        }
+    }
+    return 0
+}

Codes/0976-largest-perimeter-triangle.go

@@ -0,0 +1,19 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-28 13:21:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-28 13:27:11
+ */
+import java.util.Arrays;
+
+class Solution {
+    public int largestPerimeter(int[] nums) {
+        Arrays.sort(nums);
+        for (int i = nums.length - 3; i >= 0; i--) {
+            if (nums[i] + nums[i + 1] > nums[i + 2]) {
+                return nums[i] + nums[i + 1] + nums[i + 2];
+            }
+        }
+        return 0;
+    }
+}

Codes/0976-largest-perimeter-triangle.java

@@ -0,0 +1,15 @@
+'''
+Author: LetMeFly
+Date: 2025-09-28 13:21:46
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-09-28 13:30:31
+'''
+from typing import List
+
+class Solution:
+    def largestPerimeter(self, nums: List[int]) -> int:
+        nums.sort()
+        for i in range(len(nums) - 3, -1, -1):
+            if nums[i] + nums[i + 1] > nums[i + 2]:
+                return nums[i] + nums[i + 1] + nums[i + 2]
+        return 0

Codes/0976-largest-perimeter-triangle.py

@@ -0,0 +1,17 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-28 13:21:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-28 13:25:57
+ */
+impl Solution {
+    pub fn largest_perimeter(mut nums: Vec<i32>) -> i32 {
+        nums.sort();
+        for i in (0..nums.len()-2).rev() {
+            if nums[i] + nums[i + 1] > nums[i + 2] {
+                return nums[i] + nums[i + 1] + nums[i + 2];
+            }
+        }
+        0
+    }
+}

Codes/0976-largest-perimeter-triangle.rs

@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-09-07 23:24:39
  */
 pub struct Solution;
-include!("0611-valid-triangle-number_20250926.rs");  // 这个fileName是会被脚本替换掉的
+include!("0976-largest-perimeter-triangle.rs");  // 这个fileName是会被脚本替换掉的

Codes/lib.rs

@@ -459,6 +459,7 @@
 |0961.在长度2N的数组中找出重复N次的元素|简单|<a href="https://leetcode.cn/problems/n-repeated-element-in-size-2n-array/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/05/21/LeetCode%200961.%E5%9C%A8%E9%95%BF%E5%BA%A62N%E7%9A%84%E6%95%B0%E7%BB%84%E4%B8%AD%E6%89%BE%E5%87%BA%E9%87%8D%E5%A4%8DN%E6%AC%A1%E7%9A%84%E5%85%83%E7%B4%A0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/124897591" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-closest-palindrome/solution/letmefly-da-an-hou-xuan-by-letmefly-2-k2vn/" target="_blank">LeetCode题解</a>|
 |0966.元音拼写检查器|中等|<a href="https://leetcode.cn/problems/vowel-spellchecker/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/14/LeetCode%200966.%E5%85%83%E9%9F%B3%E6%8B%BC%E5%86%99%E6%A3%80%E6%9F%A5%E5%99%A8/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151690858" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/vowel-spellchecker/solutions/3781983/letmefly-966yuan-yin-pin-xie-jian-cha-qi-16uh/" target="_blank">LeetCode题解</a>|
 |0970.强整数|中等|<a href="https://leetcode.cn/problems/powerful-integers/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/05/02/LeetCode%200970.%E5%BC%BA%E6%95%B4%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/130461751" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/powerful-integers/solutions/2253101/letmefly-970qiang-zheng-shu-by-tisfy-w22m/" target="_blank">LeetCode题解</a>|
+|0976.三角形的最大周长|简单|<a href="https://leetcode.cn/problems/largest-perimeter-triangle/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/28/LeetCode%200976.%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%91%A8%E9%95%BF/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/152215094" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/largest-perimeter-triangle/solutions/3794128/letmefly-976san-jiao-xing-de-zui-da-zhou-atq1/" target="_blank">LeetCode题解</a>|
 |0982.按位与为零的三元组|困难|<a href="https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/03/04/LeetCode%200982.%E6%8C%89%E4%BD%8D%E4%B8%8E%E4%B8%BA%E9%9B%B6%E7%9A%84%E4%B8%89%E5%85%83%E7%BB%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/129334313" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/triples-with-bitwise-and-equal-to-zero/solutions/2146568/letmefly-982an-wei-yu-wei-ling-de-san-yu-071t/" target="_blank">LeetCode题解</a>|
 |0983.最低票价|中等|<a href="https://leetcode.cn/problems/minimum-cost-for-tickets/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/10/01/LeetCode%200983.%E6%9C%80%E4%BD%8E%E7%A5%A8%E4%BB%B7/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/142672522" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-cost-for-tickets/solutions/2936476/letmefly-983zui-di-piao-jie-ji-yi-hua-so-o7w3/" target="_blank">LeetCode题解</a>|
 |0987.二叉树的垂序遍历|困难|<a href="https://leetcode.cn/problems/vertical-order-traversal-of-a-binary-tree/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/02/13/LeetCode%200987.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%9E%82%E5%BA%8F%E9%81%8D%E5%8E%86/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/136106019" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/vertical-order-traversal-of-a-binary-tree/solutions/2639036/letmefly-987er-cha-shu-de-chui-xu-bian-l-l9yo/" target="_blank">LeetCode题解</a>|

README.md

@@ -0,0 +1,183 @@
+---
+title: 976.三角形的最大周长：贪心(排序)
+date: 2025-09-28 13:31:12
+tags: [题解, LeetCode, 简单, 贪心, 数组, 数学, 排序]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】976.三角形的最大周长：贪心(排序)
+
+力扣题目链接：[https://leetcode.cn/problems/largest-perimeter-triangle/](https://leetcode.cn/problems/largest-perimeter-triangle/)
+
+<p>给定由一些正数（代表长度）组成的数组 <code>nums</code>&nbsp;，返回 <em>由其中三个长度组成的、<strong>面积不为零</strong>的三角形的最大周长</em>&nbsp;。如果不能形成任何面积不为零的三角形，返回&nbsp;<code>0</code>。</p>
+
+<p>&nbsp;</p>
+
+<ol>
+</ol>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [2,1,2]
+<strong>输出：</strong>5
+<strong>解释：</strong>你可以用三个边长组成一个三角形:1 2 2。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [1,2,1,10]
+<strong>输出：</strong>0
+<strong>解释：</strong>
+你不能用边长 1,1,2 来组成三角形。
+不能用边长 1,1,10 来构成三角形。
+不能用边长 1、2 和 10 来构成三角形。
+因为我们不能用任何三条边长来构成一个非零面积的三角形，所以我们返回 0。</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>3 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
+</ul>
+
+
+    
+## 解题方法：排序
+
+将边长排序，采用贪心思维，先看最长边能不能用上：
+
+> 选中所有边中的最长边，在此前提下，另外两边之和需要大于最长边。并且我们希望三角形周长最长，我们应该怎么选另外两条边？
+>
+> 很简单，不用动脑子就知道，另外两条边就选剩下的边中最长的两条。
+>
+> + 如果另外两边之和大于最长边，则完美，最长的三条边可以组成三角形，那么选这三条边所组成的三角形周长一定最长；
+>
+> + 否则，很遗憾，没有任何剩下的两条边之和可以大于第一条选中的最长边，可以说明最长的那条边一定不会被选中，直接扔掉最长边。
+
+如果发现最长边不能被用上，扔掉最长边，剩下的所有边仍然按照这个思路去挑选就好。
+
++ 时间复杂度$O(n\log n)$，其中$n=len(nums)$
++ 空间复杂度$O(\log n)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-28 13:21:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-28 13:22:32
+ */
+class Solution {
+public:
+    int largestPerimeter(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        for (int i = nums.size() - 3; i >= 0; i--) {
+            if (nums[i] + nums[i + 1] > nums[i + 2]) {
+                return nums[i] + nums[i + 1] + nums[i + 2];
+            }
+        }
+        return 0;
+    }
+};
+```
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-09-28 13:21:46
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-09-28 13:30:31
+'''
+from typing import List
+
+class Solution:
+    def largestPerimeter(self, nums: List[int]) -> int:
+        nums.sort()
+        for i in range(len(nums) - 3, -1, -1):
+            if nums[i] + nums[i + 1] > nums[i + 2]:
+                return nums[i] + nums[i + 1] + nums[i + 2]
+        return 0
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-28 13:21:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-28 13:27:11
+ */
+import java.util.Arrays;
+
+class Solution {
+    public int largestPerimeter(int[] nums) {
+        Arrays.sort(nums);
+        for (int i = nums.length - 3; i >= 0; i--) {
+            if (nums[i] + nums[i + 1] > nums[i + 2]) {
+                return nums[i] + nums[i + 1] + nums[i + 2];
+            }
+        }
+        return 0;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-28 13:21:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-28 13:29:34
+ */
+package main
+
+import "sort"
+
+func largestPerimeter(nums []int) int {
+    sort.Ints(nums)
+    for i := len(nums) - 3; i >= 0; i-- {
+        if nums[i] + nums[i + 1] > nums[i + 2] {
+            return nums[i] + nums[i + 1] + nums[i + 2]
+        }
+    }
+    return 0
+}
+```
+
+#### Rust
+
+```rust
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-09-28 13:21:46
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-09-28 13:25:57
+ */
+impl Solution {
+    pub fn largest_perimeter(mut nums: Vec<i32>) -> i32 {
+        nums.sort();
+        for i in (0..nums.len()-2).rev() {
+            if nums[i] + nums[i + 1] > nums[i + 2] {
+                return nums[i] + nums[i + 1] + nums[i + 2];
+            }
+        }
+        0
+    }
+}
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/152215094)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/09/28/LeetCode%200976.%E4%B8%89%E8%A7%92%E5%BD%A2%E7%9A%84%E6%9C%80%E5%A4%A7%E5%91%A8%E9%95%BF/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)