[WXM] LeetCode 413. Arithmetic Slices C++

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.

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.

Approach

1. 题目大意是连续两两差值相同并且长度不小于3的组合有多少，虽然这道题归在动态规划里，但可以直接用数学的方法解，我们只要知道它这种组合长度为多长就知道有多少种了，所以我们要先计算这种连续的有多少个并计算长度，比如A=[1,2,3,4,6,7,8,9]，有两个1,2,3,4和6,7,8,9有两个连续的，然后我们记录长度，直接套公式计算相加即可，剩余看代码吧，可能讲的不是很清晰，可能会好奇为什么可以这样，因为它们是不可能重叠的，所以可以分开计算再求和。

Code

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