leetcode:413. 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.

题意&解题思路

arithmetic slices的定义是长度至少为3的数组段，其段间差值相等，要求所给数组一共会有多少个arithmetic slices。

如：1,2,3,4,5 这样的数组可以切出
[1,2,3] [2,3,4] [3,4,5] [1,2,3,4] [2,3,4,5] [1,2,3,4,5]
这6种情况。

用动态规划来处理该题目

我们用dp[i]来记录以A[i]结束的数组中有多少种arithmetic slices，则
若A[i] - A[i - 1] == A[i - 1] - A[i - 2], dp[i] = dp[i - 1] + 1
因为当前值加在A[i - 1]后可以形成一个新的arithmetic slices，另外，以A[i - 1]结尾的最长slices数组s内含有的slices总数为dp[i - 1]，则去掉s的头一个元素，再在A[i-1]后加入A[i]，其形成的新数组s’和s的结构是一样的，故s’的slices数量等于dp[i - 1]。

由这个关系，我们再将各个位置上的dp值相加起来，即可得到答案。

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