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.
解决方法:利用动态规划,设B[ i ]表示以A[ i ]为尾元素是否为算术,B[ i ]=1表示是算数,为0表示不是,初始化B[ i ]=1.
if B[ i-1 ]=1 且 A[ i ]-A[ i-1 ]=A[ i-1 ]-A[ i-2 ], B[ i ]=1
else B[i]=0;
代码如下:
class Solution {
public:
int numberOfArithmeticSlices(vector<int>& A) {
int n=A.size();
int i,j,t,result=0;
int *B=new int[n];
if(n<=2)
return 0;
for(i=0;i<n;i++){
B[i]=1;
}
for(t=2;t<n;t++){
for(j=n-1;(j-t)>=0;j--){
//for(i=0;(i+t)<n;i++){
i=j-t;
if(B[j-1]==1&&((A[j]-A[j-1])==(A[j-1]-A[j-2]))){
B[j]=1;
result++;
}
else{
B[j]=0;
}
}
}
delete []B;
return result;
}
};