Leetcode 413. Arithmetic Slices 所有等差序列 解题报告

1 解题思想

这道题是要求找出给定数组中所有的等差子序列，要求是长度大于等于3。
这道题的思想就是，首先找出一个最长的等差子序列（这个肯定是连续出现的），然后根据这个最长的长度用公式算出所有的子序列的多少。

2 原题

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.

3 AC解

public class Solution {
    //找出连续长达3的等比数组,然后用tmp*(tmp + 1) /2; 计算出其包含的大于等于3的子序列数目
    public int numberOfArithmeticSlices(int[] A) {
        int sum = 0;
        int tmp = 0;
        int n = A.length;
        for(int i=1 ; i < n - 1 ;i ++ ){
            if( A[i-1]-A[i] == A[i]-A[i+1] ){
                tmp++;
            } else{
                sum += (tmp*(tmp + 1) /2);
                tmp = 0;
            }
        }
        sum += (tmp*(tmp + 1) / 2);
        return sum;
    }
}

如果如上代码你看到时已经不能AC了，请通知我，THX