Leetcode——413. Arithmetic Slices

题目原址

https://leetcode.com/problems/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.

解题思路

该题就是想要寻找等差数列的个数，但是要求这个等差数列中元素的个数要大于等于3。因为是递归题，所以就按照递归的思想，当前的判断与前两个判断的结果有关。

判断一串数字书否是等差数列很好判断，只要array[n] - array[n-1] == array[n-1] - array[n-2]即可。因为题目要求等差数列个数要大于等于3，所以循环中初始的下标值为2，终止的小标值为数组的长度-1。有两个变量记录当前数组是否是等差数列，一个是cur，记录当前及之前的数组是否是等差数列，一个是最后返回的等差数列的个数。如果当前之前的数组不是等差数列，则将cur赋值为0，否则，cur++。这样就可以计算增加当前数组值后，又多增加的等差数列段数。因为每增加一个数，增加的等差数列数可能不止为1个。

AC代码

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