leetcode 413

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.

Subscribe to see which companies asked this question.

Show Tags

Show Similar Problems

题目太长了。。。一直没看

大意就是 给你个A，让你找A里面的存在多少个等差数列~3个元素及以上才算

思路：

1 2 3 4 5 7 8 9------>（求差）------>  1 1 1 1 2 1 1------>求差----->0 0 0 -1 1 0

6+1 = 7  一个零代表连续3个位等差数列，求连续0

代码：

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        int size = A.size();
        if(size < 3)
            return 0;
        int tmp[size - 1];
        int tmp2[size - 2];
        int i = 0;
        for (i = 0 ; i < size - 1; i ++)
        {
            tmp[i] = A[i+1] - A[i];
        }
        for (i = 0 ; i < size - 2; i ++)
        {
            tmp2[i] = tmp[i+1] - tmp[i];
        }
        int rel = 0;
        int num = 0;
        for (i = 0 ; i < size - 2; i ++)
        {
            if(tmp2[i] == 0)
            {
                num ++;
                cout<<"-----"<<endl;
            }
            else
            {
                if(num == 0)
                    continue;
                rel += (1+num)*num/2;
                num = 0;
            }
        }
        rel += (1+num)*num/2;
        return rel;
    }
};

不知道和动态规划关系在哪。。。

网上思路：

找数组里面的等差数列的个数。想法是如果一开始三个数就满足是等差数列的话，就在当前已有的数目上不断的累加count的结果。然后更新sum。