976. Largest Perimeter Triangle leetcode solution in c++

coder answered on March 3, 2022 Popularity 3/10 Helpfulness 1/10

answer 976. Largest Perimeter Triangle leetcode solution in c++

976. Largest Perimeter Triangle leetcode solution in c++

Comment

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

Popularity 3/10 Helpfulness 1/10 Language cpp

Source: www.codegrepper.com

Tags: c++ solution triangle

Link to this answer
Share Copy Link

Contributed on Mar 03 2022

coder

0 Answers Avg Quality 2/10

976. Largest Perimeter Triangle leetcode solution in c++

Contents

More Related Answers

976. Largest Perimeter Triangle leetcode solution in c++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.