class Solution
{
public:
int wiggleMaxLength(vector<int>& nums)
{
if (nums.size() < 2) return 1;
int maxLength = 1;
int preDiff = 0;
for (int i = 1; i < nums.size(); i++)
{
int diff = nums[i] - nums[i - 1];
if ((diff > 0 && preDiff <= 0) || (diff < 0 && preDiff >= 0))
{
maxLength++;
preDiff = diff;
}
}
return maxLength;
}
};
LeetCode376. 摆动序列
最新推荐文章于 2024-07-13 13:36:16 发布