Arithmetic Slices LeetCode solution in Java

1
class Solution {
2
  public int numberOfArithmeticSlices(int[] nums) {
3
    int n = nums.length;
4
    if (n < 3) {
5
      return 0;
6
    }
7
    int[] dp = new int[n - 1];
8
    dp[0] = nums[1] - nums[0];
9
    for (int i = 2; i < n; i++) {
10
      dp[i - 1] = nums[i] - nums[i - 1];
11
    }
12
    int si = 0;
13
    int count = 0;
14
    for (int i = 1; i < n - 1; i++) {
15
      if (dp[i] == dp[i - 1]) {
16
        count += (i - si);
17
      } else {
18
        si = i;
19
      }
20
    }
21
    return count;
22
  }
23
}