class Solution(object):
def numberOfArithmeticSlices(self, A):
"""
:type A: List[int]
:rtype: int
"""
n=len(A)
if n<3:return 0
#dp[i] is number of arithmetic slices ending with A[i]
dp=[0]*n
for i in xrange(2,n):
if (A[i]-A[i-1]==A[i-1]-A[i-2]):
dp[i]=dp[i-1]+1
return sum(dp)
413. Arithmetic Slices A sequence of number is called ari...
https://leetcode.com/problems/arithmetic-slices/descripti...
A sequence of number is called arithmetic if it consists ...
题目 A sequence of number is called arithmetic if it consis...
一道DP基础题，将每一步的记录在数组中就好，例如：
A sequence of number is called arithmetic if it consists ...
简单的动归，若i-2, i-1, i等差，则以第i个数结尾的等差数列总数=以i-1个数结尾的等差数列总数+1。需要...
413. Arithmetic Slices 题目大意：找出数组中存在多少等差序列(该序列在原数组是连续的) 解题...
题目链接 https://leetcode.com/problems/arithmetic-slices/desc...
本文标题：413. Arithmetic Slices
本文链接：https://www.haomeiwen.com/subject/wteimttx.html
网友评论