Arithmetic Slices

Similar Problems:

- LeetCode: Arithmetic Slices II – Subsequence
- CheatSheet: Leetcode For Code Interview
- CheatSheet: Common Code Problems & Follow-ups
- Tag: #array, #combination

A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.

For example, these are arithmetic sequence:

1, 3, 5, 7, 9 7, 7, 7, 7 3, -1, -5, -9

The following sequence is not arithmetic.

1, 1, 2, 5, 7

A zero-indexed array A consisting of N numbers is given. A slice of that array is any pair of integers (P, Q) such that 0 <= P < Q < N.

A slice (P, Q) of array A is called arithmetic if the sequence:

A[P], A[p + 1], …, A[Q – 1], A[Q] is arithmetic. In particular, this means that P + 1 < Q.

The function should return the number of arithmetic slices in the array A.

Example:

A = [1, 2, 3, 4] return: 3, for 3 arithmetic slices in A: [1, 2, 3], [2, 3, 4] and [1, 2, 3, 4] itself.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

- Solution:

// https://code.dennyzhang.com/arithmetic-slices // Basic Ideas: // // Complexity: Time O(n), Space O(1) func numberOfArithmeticSlices(A []int) int { res := 0 count, diff := 0, 1<<31 - 1 for i, _ := range A { if i == 0 { continue } v := A[i]-A[i-1] if diff == v { count++ } else { res += (count*(count-1))/2 diff, count = v, 1 } } return res + (count*(count-1))/2 }