leetcode 413. Arithmetic Slices [medium]

题目：

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.

int numberOfArithmeticSlices(vector<int>& A) {

    int len =A.size();
    if(len<3) return 0;
    vector<int> check(len,0);
    int result = 0;
    for(int i=2;i<len;i++){
        if(A[i-1]-A[i-2] == A[i]-A[i-1])
            check[i] =check[i-1]+1;
        result+=check[i];
    }

}

题解：

int numberOfArithmeticSlices(vector<int>& A) {
    int len =A.size();
    if(len<3) return 0;
    vector<int> check(len,0);
    int result = 0;
    for(int i=2;i<len;i++){
        if(A[i-1]-A[i-2] == A[i]-A[i-1])
            check[i] =check[i-1]+1;
        result+=check[i];
    }
    return result;
}

思路：

原来想的是先检验一遍长度为3的等差子序列，再检查长度为4的，以此类推，算法复杂度为O(n^2)

看discuss上的思路才发现太过naive，可以用以上方法，算法复杂度仅为O（n）

另外还收获了vector构造函数的5种写法点击打开链接