976. 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:

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

Example 2:

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

Example 3:

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

Example 4:

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

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

976. largest perimeter triangle

近期文章

近期评论

标签

热门

文章归档

分类目录

功能