Arithmetic Subarrays LeetCode solution in Java

1
class Solution {
2
  public Boolean check(int[] arr) {
3
    Arrays.sort(arr);
4
    int diff = arr[1] - arr[0];
5

6
    for (int i = 2; i < arr.length; i++) {
7
      if (arr[i] - arr[i - 1] != diff) {
8
        return false;
9
      }
10
    }
11

12
    return true;
13
  }
14

15
  public List<Boolean> checkArithmeticSubarrays(int[] nums, int[] l, int[] r) {
16
    List<Boolean> ans = new ArrayList();
17
    for (int i = 0; i < l.length; i++) {
18
      int[] arr = new int[r[i] - l[i] + 1];
19
      for (int j = 0; j < arr.length; j++) {
20
        arr[j] = nums[l[i] + j];
21
      }
22

23
      ans.add(check(arr));
24
    }
25

26
    return ans;
27
  }
28
}