Leetcode-413. Arithmetic Slices

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————

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.

这个题目有一点没考虑，就是判断不是等差数列的时候序号应该跳两个位置。 Your runtime beats 35.34% of java submissions.

public class Solution {
    public int numberOfArithmeticSlices(int[] A) {
        if(A.length < 3) return 0;
        int result = 0, start = -1;
        for(int i = 1; i < A.length - 1; i ++){
            if(A[i] - A[i-1] == A[i+1] - A[i]){
                if(start == -1) start = i-1;
            }else{
                if(start != -1) {
                    result += (i - start) * (i - start - 1) / 2;
                    start = -1;
                    i += 1;
                }
            }
        }
        if(start != -1) result += (A.length-1-start)*(A.length-start-2)/2;
        return result;
    }
}