1.题目
2.解法
①一维数组+动态规划
class Solution {
public int numberOfArithmeticSlices(int[] nums) {
int n = nums.length;
if(n <= 2) return 0;
int[] dp = new int[n];
for(int i = 2; i < n; i++){
if(nums[i] - nums[i - 1] == nums[i - 1] - nums[i - 2]) dp[i] = dp[i - 1] + 1;
}
int res = 0;
for(int count : dp){
res += count;
}
return res;
}
}