Largest Perimeter Triangle LeetCode solution in Java

1
class Solution {
2
  public int largestPerimeter(int[] nums) {
3
    Arrays.sort(nums);
4

5
    for (int i = nums.length - 3; i >= 0; i--) {
6
      if (nums[i] + nums[i + 1] > nums[i + 2]) return nums[i] + nums[i + 1] + nums[i + 2];
7
    }
8
    return 0;
9
  }
10
}