976. Largest Perimeter Triangle*

976. Largest Perimeter Triangle*

https://leetcode.com/problems/largest-perimeter-triangle/

题目描述

Given an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, formed from 3 of these lengths.

If it is impossible to form any triangle of non-zero area, return 0.

Example 1:

Input: [2,1,2]
Output: 5

Example 2:

Input: [1,2,1]
Output: 0

Example 3:

Input: [3,2,3,4]
Output: 10

Example 4:

Input: [3,6,2,3]
Output: 8

Note:

• 3 <= A.length <= 10000
• 1 <= A[i] <= 10^6

C++ 实现 1

对数组 A 进行从大到小排序, 找出周长最长的三角形. 只要最小的两条边大于第三条边即可.

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