Arithmetic Slices

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.

解题思路：用动态规划的方法解这道题，用dp（i）表示以数组中第i个元素为结尾的arithmetic slice的数目，那么如果第i个元素与第i-1和i-2个元素刚好是一个arithmetic slice，dp（i）=dp（i-1）+1，即以第i-1个元素为结尾的arithmetic slice在结尾加上第i个元素成为新的arithmetic slice，加上有第i-2，i-1，i个元素组成的新arithmetic slice。最后只要把以各个元素结尾的arithmetic slices加起来就是整个数组的arithmetic slices个数。程序代码如下：

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        int size = A.size();
        if (size < 3)
            return 0;
        vector<int> dp(size, 0);

        if (A[0] + A[2] == 2 * A[1])
            dp[2] = 1;
        int result = dp[2];

        for (int i = 3; i < size; i++) {
            if (A[i] + A[i - 2] == 2 * A[i - 1])
                dp[i] = dp[i - 1] + 1;
            result += dp[i];
        }

        return result;
    }
};