# LeetCode - 0976. Largest Perimeter Triangle
### 題目網址：https://leetcode.com/problems/largest-perimeter-triangle/
###### tags: `LeetCode` `Easy` `數學`

/*
    -LeetCode format-
    Problem: 976. Largest Perimeter Triangle
    Difficulty: Easy
    
    by Inversionpeter
*/



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;
    }
};