- 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
给出nums数组,判断里面有多少个等差数列子数组。
等差数列最短长度为3, 满足nums[i] - nums[i-1] = nums[i-1] - nums[i-2]。
子数组应是连续的。
思路:
DP
定义和nums等长的dp数组,dp[i]表示以nums[i]结尾,有多少个等差数列子数组。
下面看dp[i]的递推。
比如[1,2,3,4]
等差数列至少要3个元素,所以从“3”开始看,它满足nums[i] - nums[i-1] = nums[i-1] - nums[i-2],所以dp[2] = 1。
然后到"4"的位置,仍然满足nums[i] - nums[i-1] = nums[i-1] - nums[i-2],
这时[2,3,4]就是一个等差数列,
除此之外,4还是前面等差子数组[1,2,3]的延伸,它们一起构成了一个新的子数组[1,2,3,4], 假设现在是位置i, 那么这个以nums[i]为结尾的延伸子数组的个数 和 前面的个数dp[i-1]是一样的。
延伸数组的个数dp[i-1] 和当前子数组([2,3,4])的个数相结合,得到dp[i] = dp[i-1] + 1
如果在当前位置i不满足等差数列的条件,那么dp[i] = 0
返回的结果是以每个nums[i]为结尾的等差子数组的和,即对所有dp[i]求和。
public int numberOfArithmeticSlices(int[] nums) {
if(nums.length <= 2) return 0;
int result = 0;
int n = nums.length;
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;
result += dp[i];
}
}
return result;
}
可以看到dp[i]只和它前面一个元素dp[i-1]有关系,所以不需要定义和nums一样长的数组,一个数字就够了。
public int numberOfArithmeticSlices(int[] nums) {
if(nums.length <= 2) return 0;
int result = 0;
int n = nums.length;
//int[] dp = new int[n];
int dp = 0;
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;
//result += dp[i];
dp ++;
result += dp;
} else {
dp = 0;
}
}
return result;
}