LeetCode 413. Arithmetic Slices 题解

最新推荐文章于 2018-06-25 22:10:31 发布

daqiang95

最新推荐文章于 2018-06-25 22:10:31 发布

阅读量344

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/daqiang95/article/details/52929773

版权

leetcode 专栏收录该内容

38 篇文章 0 订阅

订阅专栏

413. Arithmetic Slices

My Submissions

Total Accepted: 3109
Total Submissions: 5803
Difficulty: Medium
Contributors: XiangyuLi926

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.

解题思路：

本题即计算所有长度大于等于三的等差数列的个数。令n为等差子数列的长度，i为该子数列中长度大于等于三的等差数列的个数。可以看出n=3时，i=1；

n=4时，i=3，n=5时，i=6。易得n = k时，i= (1+k-2)*(k-2)/2。记录所有等差子数列的长度，计算其和即可。

代码展示：

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
        int n = A.size();
        if(!n) return 0;
        if(n<2) return 0;
        int diff = A[1]-A[0];
        int length = 2;
        

        vector<int> res;
        for(int i=2;i<n;i++)
        {
            if(A[i]-A[i-1]==diff)
            {
                length++;
            }
            else
            {
                
                if (length>2) res.push_back(length);
                length = 2;
                diff = A[i]-A[i-1];
            }
        }
        if(length>2) res.push_back(length);
        int ans=0;
        int size_res=res.size();
        for(int i=0;i<size_res;i++)
        {
            ans+=(res[i]-1)*(res[i]-2)/2;
        }
        return ans;
    }
};