https://leetcode.com/problems/wiggle-subsequence/description/
subsequence代表数字间隔in array
解题思路：up and down represents greater and lesser.
代码：
class Solution {
public int wiggleMaxLength(int[] nums) {
if(nums.length == 0) return 0;
int up = 1;
int down = 1;
for(int i = 1; i < nums.length; i++){
if(nums[i] > nums[i - 1]){
up = down + 1;
}else if(nums[i] < nums[i - 1]){
down = up + 1;
}
}
return Math.max(up, down);
}
}
376. Wiggle Subsequence A sequence of numbers is called a...
https://leetcode.com/problems/wiggle-subsequence/descript...
A sequence of numbers is called a wiggle sequence if the ...
Question A sequence of numbers is called a wiggle sequenc...
A sequence of numbers is called a wiggle sequence if the ...
3月21日 376. Wiggle Subsequence分析：这个题要做到复杂度O(N)，可以考虑用dp。up[...
问题描述： A sequence of numbers is called a wiggle sequence i...
A sequence of numbers is called a wiggle sequence if the ...
题目链接 https://leetcode.com/problems/wiggle-subsequence/des...
本文标题：376. Wiggle Subsequence
本文链接：https://www.haomeiwen.com/subject/lprvmftx.html
网友评论