题目链接
https://leetcode.cn/problems/wiggle-subsequence/
在这里插入图片描述
代码
class Solution:
def wiggleMaxLength(self, nums: List[int]) -> int:
if len(nums) <= 1:
return len(nums)
cur = 0
pre = 0
result = 1
for i in range(len(nums) - 1):
cur = nums[i + 1] - nums[i]
if (cur > 0 and pre <= 0) or (cur < 0 and pre >= 0):
result += 1
pre = cur
return result