LeetCode (LeetCode) 376. Swing sequence Python

Question link

https://leetcode.cn/problems/wiggle-subsequence/

Insert image description here

code

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