int wiggleMaxLength(int* nums, int numsSize){
if (numsSize < 2) {
return numsSize;
}
int prevnum,num;
num = prevnum = 0;
int count = 1;
for (int i = 0; i < numsSize - 1;++i) {
//计算差值
int num = nums[i + 1] - nums[i];
//统计结果
if ((num > 0 && prevnum <= 0) || (num < 0 && prevnum >= 0)) {
count++;
prevnum = num;
}
}
return count;
}
LeetCode:376. 摆动序列
最新推荐文章于 2024-07-16 23:15:32 发布