LeetCode976 三角形的最大周长（Java排序简单应用-防自闭题）

import java.util.*;
import java.math.*;

class Solution {
    public int largestPerimeter(int[] A) {
        Arrays.sort(A);
        for(int i=A.length-3; i>=0; i--){
            if(A[i]+A[i+1] > A[i+2]){
                return A[i]+A[i+1]+A[i+2];
            }
        }
        return 0;
    }
}
public class Main {
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] A = new int[n];
        for(int i=0; i<n; i++){
            A[i] = scanner.nextInt();
        }
        Solution solution = new Solution();
        System.out.println(solution.largestPerimeter(A));
    }
}