413. Arithmetic Slices（第九周）

Description：

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.

解题思路：

这是动态规划当中的一道题。理解好题目的意思就会变得比较简单。这是将一个给定的数组，让你找出当中含有多少个符合标准的子数组，其实就是找三个及以上的数，使其成为等差数列，从例子的【1,2,3,4】可以分解为【1,2,3】，【2,3,4】和【1,2,3,4】便知道可以分为1+2=3，按照数字来分数组的话可知是1+2+……+n

class Solution {
public:
    int numberOfArithmeticSlices(vector<int>& A) {
    	if(A.size() < 3) return 0;
        int count = 0;
        int result = 0;
        for(int i = 2; i < A.size() ; i++){
        	if(A[i]-A[i-1] == A[i-1]-A[i-2]){
        		count ++;
				result += count;
			}
			else
				count = 0;
		}
		return result;
    }
};