[LeetCode]Arithmetic Slices@Python

最新推荐文章于 2020-12-21 14:45:09 发布

Goofiness

最新推荐文章于 2020-12-21 14:45:09 发布

阅读量149

点赞数

分类专栏： leetcode dynamic programming 文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/97002244

版权

leetcode 同时被 2 个专栏收录

232 篇文章 0 订阅

订阅专栏

dynamic programming

43 篇文章 0 订阅

订阅专栏

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.

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

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