Leetcode之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.

代码：

方法一——运用数学知识，

class Solution {
public:
    int cal(int n) {
    int res= (n - 2)*(n - 1) / 2;
    return res;
}
    int numberOfArithmeticSlices(vector<int>& A) {
    int len = A.size();
    if (len < 3)return 0;
    int base = A[1] - A[0];
    int left = 0, right = 1, i = 1,res=0;
    while (i < len - 1) {
        if (A[i + 1] - A[i] == base) {
            right++;
        }
        else {
            if (right - left >= 2) {
                res += cal(right - left + 1);
            }
            left = i;
            right = i + 1;
            base = A[i + 1] - A[i];
        }
        i++;
    }
    if (right - left + 1 >= 3)res += cal(right - left + 1);

    return res;
}
};

方法二——动态规划：

思路：我们还可以用DP来做，定义一个一维dp数组，其中dp[i]表示，到i位置为止的算数切片的个数，那么我们从第三个数字开始遍历，如果当前数字和之前两个数字构成算数切片，那么我们更新dp[i]为dp[i-1]+1，然后res累加上dp[i]的值即可。

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

直观的去理解。

方法三——使用一个变量来代替dp的思路：

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        int res = 0, cur = 0;
        for (int i = 2; i < A.size(); ++i) {
            if (A[i] - A[i - 1] == A[i - 1] - A[i - 2]) {
                cur += 1;
                res += cur;
            } else {
                cur = 0;
            }
        }
        return res;
    }
};