[LeetCode] 976. Largest Perimeter Triangle

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

题目大意

从数组A中找出三个元素,这三个元素能围成三角形且周长最长。

思路

组成三角形的条件 a<=b<=c ,a > c - b;

class Solution {
    public int largestPerimeter(int[] A) {
        Arrays.sort(A);
        for(int i = A.length -1; i >=2 ;i--)
            if(A[i] - A[i-1] < A[i-2])
                return A[i] + A[i-1] + A[i-2];
        return 0;
    }
}

猜你喜欢

转载自blog.csdn.net/u013383813/article/details/86438724