Arithmetic Slices 等差数列个数

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.

题意：求数列中最长的那个等差数列有多少长度不小于3的等差数列。一开始以为要求所有长度不小于3的等差数列，这个题只要连续的序列，例如[1,2,3,2,3,4,5] 结果是4，没有12345等情况。

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        int n = A.size(), cnt = 0;
        vector<int> dp(n, 0);
        for(int i = 2; i < n; ++i){
            if(A[i] - A[i - 1] == A[i - 1] - A[i - 2])
                dp[i] = dp[i - 1] + 1;
            cnt += dp[i];
        }
        return cnt;
    }
};

解法二：用一个变量代替数组。

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        int n = A.size(), cnt = 0, tmp = 0;
        for(int i = 2; i < n; ++i){
            if(A[i] - A[i - 1] == A[i - 1] - A[i - 2]){
                tmp += 1;
                cnt += tmp;
            }
            else
                tmp = 0;
        }
        return cnt;
    }
};