413. Arithmetic Slices

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.

思路：

首先题目给的是一个等差数列或者说一个存在等差数列碎片的数列，可能出现1,2,3,8,9,10这种。要返回连续的等差数列的个数，不用考虑1,2,3,4,5当中这种1,3,5的情况，那么一个长度为s的等差数列里面元素大于3的等差数列一共有1+2+...+（s-2）个。

public class Solution {
    public int numberOfArithmeticSlices(int[] A) {
    	if(A == null)return 0;
        int length = A.length;
        if(length < 3)return 0;
        int count = 0 , size = 0;
        int delta = A[1] - A[0];
        for(int i = 2; i < length;i++){
        	if(A[i] - A[i - 1] == delta){
        		size++;
        		count += size;
        	}else{
        		delta = A[i] - A[i - 1];
        		size = 0;
        	}
        }
        return count;
    }
}

Anyway，程序员节快乐~