Li Kou daily question - day 31 -13 Maximum perimeter of triangle

2022.6.29 Did you brush the questions today ？

---

subject ：

Given by some positive numbers （ Representative length ） Array of components  nums , return   Consisting of three lengths 、 The area is not zero The maximum circumference of a triangle  . If we can't form any triangle with non-zero area , return  0.

analysis ：

Given an array , Find the three sides of the triangle that can form the largest perimeter inside , Then return the sum of the three sides .

Ideas ： Using sorting intelligence , Look for the last three elements from back to front , As long as the relationship is satisfied, it is the longest side .

analysis ：

1. Violent solution

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