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.

题意：如果连续一串数他们相邻之差都相等，那么他们就是一个算数切片(至少包含3个数)。现给一个数字数组，求它能被分成多少种切片

思路： 若A[I+1] - A[I] 等于 A[I] - A[I-1],则表明A[I-1]、A[I]、A[I+1]是一个算数切片，如果在不包含A[i+1]时，A[I]已经可以组成n个算数切片，那么包含A[I+1]时，A[i+1]能组成与A[i]相同数量+1的切片(新增一个切片：A[i-1]、A[I]、A[I+1])。

可利用动态规划的思想，记录数组中的每个数能与前面的数组成的切片，累加的和便是总共能组成的切片。

代码：

class Solution {
    public int numberOfArithmeticSlices(int[] A) {
        int sum =0;
        int length = A.length;
        int[] dp = new int[length];
        for(int i=2;i<length;i++){
            if((A[i]-A[i-1]) == (A[i-1]-A[i-2])){
                dp[i]=dp[i-1]+1;  //新增A[i-2]、A[i-1]、A[i]
                sum+=dp[i];
            }else{
                dp[i]=0;     //不连续则没有切片
            }
        }
        return sum;
    }
}