【LeetCode】413.Arithmetic Slices（Medium）解题报告

最新推荐文章于 2024-09-16 00:15:00 发布

郝春雨

最新推荐文章于 2024-09-16 00:15:00 发布

阅读量286

点赞数

分类专栏： LeetCode Array 文章标签： leetcode array

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/79346907

版权

LeetCode 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

Array

65 篇文章 0 订阅

订阅专栏

【LeetCode】413.Arithmetic Slices（Medium）解题报告

题目地址：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.

题意就是找等差数列个数。

Solution:

//数组          等差数列的数目   与上一组等差数列数目比较
//1 2 3               1                1 - 0 = 1 
//1 2 3 4             3                3 - 1 = 2
//1 2 3 4 5           6                6 - 3 = 3
//1 2 3 4 5 6         10              10 - 6 = 4
//time : O(n)
//space : O(1)
class Solution {
    public int numberOfArithmeticSlices(int[] A) {
        int cur = 0;
        int res = 0;
        for(int i=2 ; i<A.length ; i++){
            if(A[i] - A[i-1] == A[i-1] - A[i-2]) {
                cur++;
                res += cur;
            }else{
                cur = 0;
            }
        }
        return res;
    }
}