README.md

413. Arithmetic Slices

A sequence of numbers 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 sequences:

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 the 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.

Solutions (Ruby)

1. Solution

# @param {Integer[]} a
# @return {Integer}
def number_of_arithmetic_slices(a)
  count = 1
  ret = 0

  (2...a.length).each do |i|
    if a[i] - a[i - 1] == a[i - 1] - a[i - 2]
      count += 1
    else
      ret += (count - 1) * count / 2
      count = 1
    end
  end

  ret + (count - 1) * count / 2
end

Solutions (Rust)

1. Solution

impl Solution {
    pub fn number_of_arithmetic_slices(a: Vec<i32>) -> i32 {
        let mut count = 1;
        let mut ret = 0;

        for i in 2..a.len() {
            if a[i] - a[i - 1] == a[i - 1] - a[i - 2] {
                count += 1;
            } else {
                ret += (count - 1) * count / 2;
                count = 1;
            }
        }

        ret + (count - 1) * count / 2
    }
}