本文主要是介绍[LeetCode] Largest Perimeter Triangle，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
题目描述：
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 <= 10000
1 <= A[i] <= 10^6
C++答案：
class Solution
{
public:int largestPerimeter(vector<int>& A) {sort(A.begin(),A.end());for(int i = A.size()-1;i>=2;i--){if(A[i-2]+A[i-1]>A[i]){return (A[i-2]+A[i-1]+A[i]);}}return 0;}
};
这篇关于[LeetCode] Largest Perimeter Triangle的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
