674. Longest Continuous Increasing Subsequence
2018-03-18 11:01
393 查看
1,题目要求
Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
找到一个连续的最长递增子序列。
2,题目思路
还是利用了动态规划的基本思想。动态去依次寻找最长的递增子序列。设置一个count变量来记录每次满足递增条件的子序列的长度,然后利用maxLen变量来记录查找到某个数字时可以实现的最长的序列长度。
3,程序源码
Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
找到一个连续的最长递增子序列。
2,题目思路
还是利用了动态规划的基本思想。动态去依次寻找最长的递增子序列。设置一个count变量来记录每次满足递增条件的子序列的长度,然后利用maxLen变量来记录查找到某个数字时可以实现的最长的序列长度。
3,程序源码
class Solution { public: int findLengthOfLCIS(vector<int>& nums) { if(nums.size()==0) return 0; int maxLen = 1; int minNum = nums[0]; int count = 1; for(int i=1;i<nums.size();i++) { if(nums[i]>nums[i-1]) { count ++; maxLen = max(count, maxLen); } else { count = 1;//对长度进行重置 } } return maxLen; } };
相关文章推荐
- Leetcode 674 Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- 674-Longest Continuous Increasing Subsequence
- LeetCode-674:Longest Continuous Increasing Subsequence (最长连续增序列)
- 【菜鸟的leetcode之旅】674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- LeetCode 674.Longest Continuous Increasing Subsequence
- <easy>LeetCode Problem -- 674. Longest Continuous Increasing Subsequence
- 674. Longest Continuous Increasing Subsequence
- leetcode 674 Longest Continuous Increasing Subsequence
- LintCode "Longest Increasing Continuous subsequence II" !!
- [LintCode] Longest Increasing Continuous subsequence
- [LeetCode] Longest Continuous Increasing Subsequence 最长连续递增序列
- Lintcode 389 Longest Increasing Continuous subsequence II
- [LintCode] Longest Increasing Continuous subsequence II
- lintcode:Longest Increasing Continuous subsequence II
- LintCode 397: Longest Increasing Continuous Subsequence
- [LintCode] Longest Increasing Continuous subsequence
- 第13周 Longest Continuous Increasing Subsequence
- lintcode-easy-Longest Increasing Continuous Subsequence