题目链接:https://leetcode.com/problems/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 numberOfArithmeticSlices(vector<int>& nums) {
int n = nums.size();
if (n == 1) {
return 0;
}
int d = nums[0] - nums[1], t = 0;
int ans = 0;
// 因为等差数列的长度至少为 3,所以可以从 i=2 开始枚举
for (int i = 2; i < n; ++i) {
if (nums[i - 1] - nums[i] == d) {
++t;
}
else {
d = nums[i - 1] - nums[i];
t = 0;
}
ans += t;
}
return ans;
}
};
class Solution{
public:
int numberOfArithmeticSlices(vector<int>& A)
{
int ASize=A.size();
if(ASize<3)
return 0;
int diff=A[1]-A[0];
int count=0;
int start=0;
int i=1;
while(i<ASize)
{
if(i-start<2)
{
if(A[i]-A[i-1]!=diff)
{
start=i-1;
diff=A[i]-A[i-1];
}
}
else
{
if(A[i]-A[i-1]==diff)
{
count+=(i-start)-2+1;
}
else
{
start=i-1;
diff=A[i]-A[i-1];
}
}
i++;
}
return count;
}
};