413. Arithmetic Slices （动态规划）

1.Description

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.

---

2. Analysis

采取自底向上，从简答到复杂的演绎推导，例如：首先给出$[1,2,3]$，其结果是1，再添加一个4，即$[1,2,3,4]$,结果是3，因为除了$[1,2,3]$,还有$[2,3,4]$和$[1,2,3,4]$,假如再加一个5,即$[1,2,3,4,5]$,其结果是$3 + 1 + 1 + 1 = 6$，即在$[1,2,3,4]$的基础上还有$[3,4,5],[2,3,4,5],[1,2,3,4,5]$，现在问题就很去明朗了。新添加的数与前面的数构成arithmetic slice，而且构成的arithmetic slices的个数是可数的现行变量，这个变量随着新加入的满足arithmetic slices的数而递增。如此得到状态转移方程：

$$f(n) = f(n-1) + g(n)$$
$g(n)表示$那个线性变量。

所以我们可以用这个转移方程求出连续的满足arithmetic slices的子列的arithmetic slices数目。如果一个连续的子列计算完了，则跳到另一个子列，直到读完所有的这样的子列。

---

3. Code

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        int len = A.size();
        if(len < 3) return 0;
        vector<int> tmp;
        int i = 1;
        int prev = 0,cur = 0, count = 0;
        int res[len+1] = {0};
        //memset(res,len+1, 0);
        while(i+1 < len) {
            if(A[i] - A[i-1] == A[i+1] - A[i]) { //找到arithmetic slices，进入一个子列
                prev++;//线性变量
                res[i] = res[i-1] + prev;
                cur = res[i];
            } else { //跳到另一个子列，记录当前的arithmetic slices 数目
                if(cur > 0) {
                    count += cur;
                    cur = 0;
                    prev = 0;
                }
            }
            i++;
        }
        //注意子列只有3个数构成的情况，放在后面加入结果
        if(cur > 0) count += cur;
        return count;
    }
};

---