(Easy) Largest Perimeter Triangle LeetCode

叁歲伎倆 2021-10-29 10:46 262阅读 0赞

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. Input: [2,1,2]
  2. Output: 5

Example 2:

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

Example 3:

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

Example 4:

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

Note:

  1. 3 <= A.length <= 10000

  2. 1 <= A[i] <= 10^6

    class Solution {

    1. public int largestPerimeter(int[] A) {
    3.     if (A.length <3){
    4.         return 0;
    5.     }
    7.     Arrays.sort(A);
    9.     int len = A.length;
    10.     for(int i = len -3; i>=0;i--){
    12.         if(calc(A[i],A[i+1],A[i+2])){
    14.             return A[i]+A[i+1]+A[i+2];
    15.         }
    16.     }
    17.     return 0;
    18. }
    20. public boolean calc(int a, int b , int c){
    21.     if(a+b> c && a+c > b && b+c > a){
    22.         return true;
    23.     }
    24.     else {
    25.         return false;
    26.     }
    27. }

    }

转载于:https://www.cnblogs.com/codingyangmao/p/11285750.html

发表评论

表情：
评论列表 （有 0 条评论，262人围观）

还没有评论，来说两句吧...

相关阅读