LeetCode 413. Arithmetic Slices解题报告（python）

本文链接：https://blog.csdn.net/Orientliu96/article/details/104117187

413. Arithmetic Slices

Arithmetic Slices python solution

题目描述

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:
在这里插入图片描述
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.
在这里插入图片描述

解析

题目的意思比较好理解，给定数列A，求A中共有多少个arithmetic数列。
根据arithmetic数列的特点，至少需要3个元素才可行。
其实问题就转化为对于含有个元素的arithmetic数列，其arithmetic子数列的个数是多少。
例如4个元素的arithmetic数列，子arithmetic数列个数为：
（4-3+1）+（4-4+1）=3
例如5个元素的arithmetic数列，子arithmetic数列个数为：
（5-3+1）+（5-4+1）+（5-5+1）=6
则n个元素的arithmetic数列，子arithmetic数列个数为：
（1+n）+(n) +…+1

代码中用num表示总的arithmetic数列的个数，consecutive表示A中某个arithmetic的长度（即上述推导的n）

class Solution:
    def numberOfArithmeticSlices(self, A: List[int]) -> int:
        consecutive, num=0,0
        for i in range (2,len(A)):
            if A[i-1]-A[i-2]==A[i]-A[i-1]:
                consecutive+=1
                num+=consecutive
            else:consecutive=0
        return num