Ai
1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
wiggle-subsequence.cpp 560 Bytes
一键复制 编辑 原始数据 按行查看 历史
kamyu 提交于 2016-07-21 14:11 +08:00 . Create wiggle-subsequence.cpp
// Time: O(n)
// Space: O(1)
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
if (nums.size() < 2) {
return nums.size();
}
int length = 1, up = 0;
for (int i = 1; i < nums.size(); ++i) {
if (nums[i - 1] < nums[i] && (up == 0 || up == 1)) {
++length;
up = -1;
} else if (nums[i - 1] > nums[i] && (up == 0 || up == -1)) {
++length;
up = 1;
}
}
return length;
}
};
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助