-
Notifications
You must be signed in to change notification settings - Fork 119
/
Copy pathArithmetic Slices.js
42 lines (33 loc) · 1.16 KB
/
Arithmetic Slices.js
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
41
42
// Runtime: 50 ms (Top 70.73%) | Memory: 41.90 MB (Top 54.1%)
/**
* @param {number[]} nums
* @return {number}
*/
var numberOfArithmeticSlices = function(nums) {
if (nums.length < 3) return 0
const diff = []
/* fill our array of differences */
for (let i = 1; i < nums.length; i++) {
diff.push(nums[i] - nums[i - 1])
}
/* if the first two numbers of our difference array are equal
* then set our multiplier to 1
* and also set our "previous" variable to 1
* otherwise set both to 0 representing no sequence found yet
*/
let multiplier = diff[1] === diff[0] ? 1 : 0
let dp = diff[1] === diff[0] ? 1 : 0 // our "previous" variable
/* loop thru our differences from idx 2 (0 and 1 have been
* accounted for),
* and check for continuing sequences
*/
for (let i = 2; i < diff.length; i++) {
if (diff[i] === diff[i - 1]) { // if equal, increment our multiplier
multiplier++
} else { // if not equal, set our multiplier back to 0
multiplier = 0
}
dp = dp + 1 * multiplier // recurrence relation
}
return dp // our "previous" variable
}