Arithmetic Slices LeetCode solution in C++

1
class Solution {
2
 public:
3
  int numberOfArithmeticSlices(vector<int> &nums) {
4
    int n = nums.size(), i, j, count = 0, comm_diff;
5
    for (i = 0; i <= n - 3; i++) {
6
      comm_diff = nums[i + 1] - nums[i];
7
      for (j = i + 1; j < n; j++) {
8
        if (nums[j] - nums[j - 1] == comm_diff) {
9
          if ((j - i + 1) >= 3) {
10
            count++;
11
          }
12
        } else {
13
          break;
14
        }
15
      }
16
    }
17
    return count;
18
  }
19
};