Maximum Gap LeetCode solution in Java

1
class Solution {
2
  public int maximumGap(int[] nums) {
3
    Arrays.sort(nums);
4
    int res = 0;
5
    if (nums.length == 0) {
6
      return 0;
7
    }
8
    for (int i = 0; i < nums.length - 1; i++) {
9
      res = Math.max(Math.abs(nums[i] - nums[i + 1]), res);
10
    }
11
    return res;
12
  }
13
}