-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleetcode_376.py
More file actions
48 lines (42 loc) · 1.16 KB
/
leetcode_376.py
File metadata and controls
48 lines (42 loc) · 1.16 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
# coding=utf-8
from typing import List
class Solution:
"""
最长摆动子序列的长度
"""
def wiggle_max_length(self, nums: List[int]) -> int:
"""
Time: O(n), Space: O(1)
:param nums:
:return:
"""
if not nums:
return 0
i = l = 1
while i < len(nums) and nums[i] == nums[i - 1]:
i += 1
while i < len(nums):
if i < len(nums) and nums[i] > nums[i - 1]:
l += 1
while i < len(nums) and nums[i] >= nums[i - 1]:
i += 1
if i < len(nums) and nums[i] < nums[i - 1]:
l += 1
while i < len(nums) and nums[i] <= nums[i - 1]:
i += 1
return l
def wiggle_max_length2(self, nums: List[int]) -> int:
"""
Time: O(n), Space: O(1)
:param nums:
:return:
"""
if not nums:
return 0
up = down = 1
for i in range(1, len(nums)):
if nums[i] > nums[i - 1]:
up = down + 1
if nums[i] < nums[i - 1]:
down = up + 1
return max(up, down)