本文介绍了一种求解给定长度数组中能组成的最大周长三角形的算法。通过排序和遍历的方式，找到满足构成三角形条件的三个边长，实现高效计算。文章包含多个示例输入和输出，帮助理解算法逻辑。
Given an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, formed from 3 of these lengths.
If it is impossible to form any triangle of non-zero area, return 0.
Example 1:
Input: [2,1,2]
Output: 5
Example 2:
Input: [1,2,1]
Output: 0
Example 3:
Input: [3,2,3,4]
Output: 10
Example 4:
Input: [3,6,2,3]
Output: 8
Note:
3 <= A.length <= 100001 <= A[i] <= 10^6
又没啥好说的，排序去一个个对就OK
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
