leetcode 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]连续3个数计1。    [1,2,3,4]连续4个数计3。       [1,2,3,4,5]连续5个数计6。   这样的规律就是连续n个数计(n-2)+(n-3)+.....+1。

那么就是要找出有几个连续n个数，我用一个arraylist来存每次获得的连续n个数的n。

public int numberOfArithmeticSlices(int[] A) {
		if(A.length<=2){
			return 0;
		}
		int sub=A[1]-A[0];
		ArrayList<Integer> lianxuNum=new ArrayList<Integer>();
		int lianxu=1;
		for(int i=2;i<A.length;i++){
			int thisSub=A[i]-A[i-1];
			if(thisSub==sub){
				lianxu++;
			}
			else{
				if(lianxu>=2){
					lianxuNum.add(lianxu+1);//因为有2个间隔一样表示是3个连续的数
				}
				sub=thisSub;
				lianxu=1;
			}
		}
		if(lianxu>=2){
			lianxuNum.add(lianxu+1);
		}
		int result=0;
		for(int i=0;i<lianxuNum.size();i++){
			int thisNum=lianxuNum.get(i)-2;
			if(thisNum==1){
				result+=1;
			}
			else{
				result+=(1+thisNum)*thisNum/2;//从1加到n-2的和：(首项+末项)*项数/2
			}			
		}
		return result;
	}

发现大神的解法思路是差不多的。

public int numberOfArithmeticSlices(int[] A) {
        if(A == null || A.length < 3)
            return 0;
        int sum = 0;
        int len = 2;

        for(int i=2;i<A.length;i++) {

            // keep increasing the splice
            if(A[i] - A[i-1] == A[i-1] - A[i-2]) {
                len++;
            }
            else {
                if(len > 2) {
                    sum += calculateSlices(len);
                }
                // reset the length of new slice
                len = 2;
            }
        }
        // add up the slice in the rear
        if(len>2)
            sum += calculateSlices(len);

        return sum;
    }

    private int calculateSlices(int n){
        return (n-1)*(n-2)/2;
    }

还有一个更简洁的写法解法：

public int numberOfArithmeticSlices(int[] A) {
    int curr = 0, sum = 0;
    for (int i=2; i<A.length; i++)
        if (A[i]-A[i-1] == A[i-1]-A[i-2]) {
            curr += 1;
            sum += curr;
        } else {
            curr = 0;
        }
    return sum;
}

这个原理是1=1，3=1+2，6=1+2+3......