Ai
1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

Create your Gitee Account
Explore and code with more than 13.5 million developers,Free private repositories !:)
Sign up
文件
Clone or Download
longest-continuous-increasing-subsequence.cpp 390 Bytes
Copy Edit Raw Blame History
kamyu authored 2017-09-10 15:09 +08:00 . Create longest-continuous-increasing-subsequence.cpp
// Time: O(n)
// Space: O(1)
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int result = 0, count = 0;
for (int i = 0; i < nums.size(); ++i) {
if (i == 0 || nums[i - 1] < nums[i]) {
result = max(result, ++count);
} else {
count = 1;
}
}
return result;
}
};
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

Search