Leetcode Algorithms - Dynamic Programming：413. 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.

代码

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        count = 0;
        for (int i = 0; i + 2 < A.size(); i++)
            countSlicesStartingAt(A, i);
        return count;
    }
private:
    int count;

    void countSlicesStartingAt(vector<int>& A, int from) {
        int diff = A[from + 1] - A[from];
        for (int offset = 2; from + offset < A.size(); offset++) {
            if (A[from+offset] - A[from+offset-1] == diff)
                count++;
            else
                break;
        }
    }
};

分析

这道题和647题求回文子串数的题目解题思路大体一致。遍历数组，对每个数都进行如下操作：往后遍历并计数直至不能构成等差数列。这样的算法时间复杂度是O(n^2)，leetcode上动态规划思想的标答时间复杂度是O(n)，值得学习，引用一下：

public class Solution {
    public int numberOfArithmeticSlices(int[] A) {
        int dp = 0;
        int sum = 0;
        for (int i = 2; i < A.length; i++) {
            if (A[i] - A[i - 1] == A[i - 1] - A[i - 2]) {
                dp = 1 + dp;
                sum += dp;
            } else
                dp = 0;
        }
        return sum;
    }
}