446. Arithmetic Slices II - Subsequence

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 subsequence slice of that array is any sequence of integers (P0, P1, ..., Pk) such that 0 ≤ P0 < P1 < ... < Pk < N.

A subsequence slice (P0, P1, ..., Pk) of array A is called arithmetic if the sequence A[P0], A[P1], ..., A[Pk-1], A[Pk] is arithmetic. In particular, this means that k ≥ 2.

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

The input contains N integers. Every integer is in the range of -231 and 231-1 and 0 ≤ N ≤ 1000. The output is guaranteed to be less than 231-1.

 

Example:

Input: [2, 4, 6, 8, 10]

Output: 7

Explanation:
All arithmetic subsequence slices are:
[2,4,6]
[4,6,8]
[6,8,10]
[2,4,6,8]
[4,6,8,10]
[2,4,6,8,10]
[2,6,10]

Rust Solution

struct Solution;

use std::collections::HashMap;

impl Solution {
    fn number_of_arithmetic_slices(a: Vec<i32>) -> i32 {
        let n = a.len();
        let mut dp: HashMap<(usize, i64), usize> = HashMap::new();
        let mut res = 0;
        for i in 0..n {
            for j in 0..i {
                let diff = a[i] as i64 - a[j] as i64;
                let prev = *dp.entry((j, diff)).or_insert(1);
                res += prev - 1;
                *dp.entry((i, diff)).or_insert(1) += prev;
            }
        }
        res as i32
    }
}

#[test]
fn test() {
    let a = vec![2, 4, 6, 8, 10];
    let res = 7;
    assert_eq!(Solution::number_of_arithmetic_slices(a), res);
    let a = vec![2, 2, 3, 4];
    let res = 2;
    assert_eq!(Solution::number_of_arithmetic_slices(a), res);
    let a = vec![0, 2000000000, -294967296];
    let res = 0;
    assert_eq!(Solution::number_of_arithmetic_slices(a), res);
}

Having problems with this solution? Click here to submit an issue on github.