动态规划 一维 413. Arithmetic Slices (Medium)

An integer array 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, [1,3,5,7,9], [7,7,7,7], and [3,-1,-5,-9] are arithmetic sequences.
Given an integer array nums, return the number of arithmetic subarrays of nums.
A subarray is a contiguous subsequence of the array.
Example 1:
Input: nums = [1,2,3,4]
Output: 3
Explanation: We have 3 arithmetic slices in nums: [1, 2, 3], [2, 3, 4] and [1,2,3,4] itself.
Example 2:
Input: nums = [1]
Output: 0
Constraints:
1 <= nums.length <= 5000
-1000 <= nums[i] <= 1000

一开始写的，不知道为啥错了

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& nums) {
        if(nums.size() < 3)
            return 0;
        vector<int> dp(nums.size(),-2);
        dp[1] = -1;
        int diff = nums[1] - nums[0];
        for(int i = 2; i < nums.size(); i ++){
            if(nums[i] - nums[i-1] == diff){
                dp[i] = dp[i-1] + 1;
            }
            else{
                if(i+2 < nums.size()){
                    dp[i+1] = -1;
                    diff = nums[i+1] - nums[i];
                    i++;
                }
                else{
                    break;//如果不够三个就没必要算了
                }
            }
        }
        int res = 0;
        for(int i = 0; i < dp.size(); i ++){
            if(dp[i] >= 0)
                res += (dp[i] + 1);
        }
        return res;
    }
};

答案

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& nums) {
        if(nums.size() < 3)
            return 0;
        vector<int> dp(nums.size(),0);
        for(int i = 2; i < nums.size(); i++){
            if(nums[i] - nums[i-1] == nums[i-1] - nums[i-2]){
                dp[i] = dp[i-1] + 1;
            }
        }
        return accumulate(dp.begin(),dp.end(),0);
    }
};