答案:
class Solution {
public int largestPerimeter(int[] A) {
int len = A.length;
if(len < 3){
return 0;
}
Arrays.sort(A);
while(len-3>=0){
if(A[len-1]-A[len-2] < A[len-3]){
return A[len-1]+A[len-2]+A[len-3];
}
else{
len = len-1;
}
}
return 0;
}
}