Largest Perimeter Triangle LeetCode solution in C++

1
class Solution {
2
 public:
3
  int largestPerimeter(vector<int> &nums) {
4
    // sort the elements
5
    sort(nums.begin(), nums.end());
6
    // iterate in everse order to get maximum perimeter
7
    for (int i = nums.size() - 2; i >= 1; i--) {
8
      // Triangle is formed if sum of two sides is greater than third side
9
      if (nums[i] + nums[i - 1] > nums[i + 1])
10
        return (nums[i] + nums[i + 1] +
11
                nums[i - 1]); // return perimeter which is sum of three sides
12
    }
13
    return 0; // when no triangle possible it will come out of loop so return 0
14
              // here
15
  }
16
};