413. Arithmetic Slices

最新推荐文章于 2017-09-19 12:24:39 发布

wuh2333

最新推荐文章于 2017-09-19 12:24:39 发布

阅读量310

点赞数

本文链接：https://blog.csdn.net/wuh2333/article/details/53011632

版权

原题如下：

413.Arithmetic Slices

Asequence of number is called arithmetic if it consists of at least threeelements and if the difference between any two consecutive elements is thesame.

For example, these arearithmetic sequence:

1, 3, 5, 7, 9

7, 7, 7, 7

3, -1, -5, -9

The following sequence is notarithmetic.

1, 1, 2, 5, 7

A zero-indexed array Aconsisting 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 iscalled arithmetic if the sequence:
A[P], A[p + 1], ..., A[Q - 1], A[Q] is arithmetic. In particular, this meansthat P + 1 < Q.

The function should returnthe 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.

题目大意：给定一个数组，找到题目中所有的长度大于等于3的等差子数列的数目。

解题思路：这道题目也是比较简单的，不知道为什么算medium难度的题，先求出数组n个元素两两之间的差值存到一个差值数组中，然后找出连续相等的差值的长度count，构建一个长度为n-1的结果数组res，那么根据count的值可以求出res[i]的值，若count=0,说明差值数组暂时没有两个连续相同的数，则res[i]=res[i-1]。若是count=1,说明差值数组中有两个是连续相等的，所以res[i]=res[i-1]+1，若是count>1,则res[i]=2*res[i-1]-res[i-2]+1。

算法：

input:A(数组)

output:res[n-2](n为)

n=A.size();

if(n<3)return 0;

vector<int>diff=every difference between any two consecutive elementsof A;//差值数组

vector<int> res(n-1,0);

int count=0;

for elements from 1 to n-2 in diff

if(diff[i]==diff[i-1]){

count++;

}