-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy pathArithmetic_Slices.cpp
40 lines (40 loc) · 1.12 KB
/
Arithmetic_Slices.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
class Solution {
public:
/*
int numberOfArithmeticSlices(vector<int>& arr) {
int n = arr.size();
if(n == 0) return 0;
vector<int> interval(n - 1);
for(int i = 0; i < n - 1; ++i) {
interval[i] = arr[i + 1] - arr[i];
}
int result = 0;
for(int i = 0; i < n - 1; ++i) {
int len = 1;
while(i + 1 < n - 1 and interval[i] == interval[i + 1]) {
++i;
len++;
}
int elem = len + 1;
result += ((elem - 2) * (elem - 1)) / 2;
}
return result;
}
*/
int numberOfArithmeticSlices(vector<int>& arr) {
int n = arr.size();
if(n < 3) return 0;
vector<int> dp(n, 0); // dp[i] = number of arithmatic slices ended at i
if(arr[2] - arr[1] == arr[1] - arr[0]) {
dp[2] = 1;
}
int result = dp[2];
for(int i = 3; i < n; ++i) {
if(arr[i] - arr[i - 1] == arr[i - 1] - arr[i - 2]) {
dp[i] = dp[i - 1] + 1;
}
result += dp[i];
}
return result;
}
};