题目地址:点击打开链接
题目描述:
A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with fewer than two elements is trivially a wiggle sequence.
For example, [1,7,4,9,2,5]
is a wiggle sequence because the differences (6,-3,5,-7,3) are alternately positive and negative. In contrast, [1,4,7,2,5]
and [1,7,4,5,5]
are not wiggle sequences, the first because its first two differences are positive and the second because its last difference is zero.
Given a sequence of integers, return the length of the longest subsequence that is a wiggle sequence. A subsequence is obtained by deleting some number of elements (eventually, also zero) from the original sequence, leaving the remaining elements in their original order.
Examples:
Input: [1,7,4,9,2,5] Output: 6 The entire sequence is a wiggle sequence. Input: [1,17,5,10,13,15,10,5,16,8] Output: 7 There are several subsequences that achieve this length. One is [1,17,10,13,10,16,8]. Input: [1,2,3,4,5,6,7,8,9] Output: 2
Follow up:
Can you do it in O(n) time?
思路:记录之前的大小和当前的大小,比较并和之前的比较结果比较,如果一正一负,num++,并tem记录当前比较值。
我的代码:
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
int len=nums.size();
if(len==0)return 0;
if(len==1)return 1;
if(len==2)return nums[0]==nums[1]?1:2;
int d=-1,x=-1;//比较结果
int tem=nums[0],num=1;
for(int i=1;i<len;i++){
if(nums[i]>tem){
if(x==1||x==-1)num++;//当前值比比较值tem大而且前一个比较值是小:x==1
d=1;
x=0;
tem=nums[i];//改变比较值
continue;
}
else if(nums[i]<tem){
if(d==1||d==-1)num++;//同上
x=1;
d=0;
tem=nums[i];
}
}
return num;
}
};