674. Longest Continuous Increasing Subsequence
2017-12-26 16:40
387 查看
自己写了个,res容器计算所有递增的数,找出最大的数列。有点繁琐。
[cpp] view plain copyclass Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int a=nums.size();
int cnt=1;
vector<int> res;
if (a==0) return 0;
if (a==1) return 1;
if (a>=2){
for(int i=1;i<a;i++)
{
if( nums[i]<=nums[i-1])
{
res.push_back(cnt);
cnt=1;
}
else if(i==a-1&&nums[i]>nums[i-1])
{
cnt=cnt+1;
res.push_back(cnt);
}
else
cnt=cnt+1;
}
}
int max=res[0];
for(int j=0;j<res.size();j++)
if (res[j]>max) max=res[j];
return max;
}
};
[cpp] view plain copyclass Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int a=nums.size();
int cnt=1;
vector<int> res;
if (a==0) return 0;
if (a==1) return 1;
if (a>=2){
for(int i=1;i<a;i++)
{
if( nums[i]<=nums[i-1])
{
res.push_back(cnt);
cnt=1;
}
else if(i==a-1&&nums[i]>nums[i-1])
{
cnt=cnt+1;
res.push_back(cnt);
}
else
cnt=cnt+1;
}
}
int max=res[0];
for(int j=0;j<res.size();j++)
if (res[j]>max) max=res[j];
return max;
}
};
相关文章推荐
- leetcode 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- LeetCode 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- LeetCode 674. Longest Continuous Increasing Subsequence
- [Leetcode] 674. Longest Continuous Increasing Subsequence 解题报告
- LeetCode674. Longest Continuous Increasing Subsequence
- LeetCode-674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence(Java)
- 674. Longest Continuous Increasing Subsequence
- 【LeetCode】674. Longest Continuous Increasing Subsequence 解题报告
- leetcode 674. Longest Continuous Increasing Subsequence
- [LeetCode] 674. Longest Continuous Increasing Subsequence 最长连续递增序列
- LWC 49:674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence。
- leetcode 674. Longest Continuous Increasing Subsequence 最长递增连续子序列