解法一:普通dp
一看到子序列就想到dp,和LIS一样的套路,存以当前元素结尾的子序列长度。由于不知道前面序列的状态,需要再存一个status数组,看期待大的还是小的元素,代码如下:
class Solution:
def wiggleMaxLength(self, nums: List[int]) -> int:
# 子序列问题 dp 设dp[i]是以他结尾一个元素,遍历之前的
dp = [1 for _ in range(len(nums))]
status = [0 for _ in range(len(nums))] # 0: 非摆动,1: 期待大的, -1: 期待小的
mx = 0
for i, num in enumerate(nums):
for j in range(0, i):
if status[j] == -1 and nums[j] > nums[i]:
if dp[j]+1 > dp[i]:
dp[i] = dp[j] + 1
status[i] = 1
elif status[j] == 1 and nums[j] < nums[i]:
if dp[j]+1 > dp[i]:
dp[i] = dp[j] + 1
status[i] = -1
elif status[j] == 0:
if dp[j]+1 > dp[i]:
if nums[j] > nums[i]: status[i] = 1
elif nums[j] < nums[i]: status[i] = -1
else: continue
dp[i] = dp[j]+1
mx = max(mx, dp[i])
return mx
解法二:贪心
类似于单调栈,不同就加到后面,相同就替换
class Solution:
def wiggleMaxLength(self, nums: List[int]) -> int:
l = []
for num in nums:
if len(l) < 2:
if not (l and num == l[-1]):
l.append(num)
else:
if l[-1] > l[-2]:
if num < l[-1]:
l.append(num)
else:
l[-1] = num
else:
if num > l[-1]:
l.append(num)
else:
l[-1] = num
return len(l)
解法三:O(N) dp
于LIS思想不太一样,需要定义i之前某个元素为结尾的序列,需要用到贪心思想。