976_LargestPerimeterTriangle - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int largestPerimeter(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int perimeter = 0, n= nums.size();
        for(int i=n-2;i>=1;i--){
            if(nums[i]> nums[i+1] - nums[i-1]){
                perimeter = max(perimeter, nums[i]+ nums[i+1]+nums[i-1]);
            }
        }
        return perimeter;
    }
};