Given an unsorted array of integers, find the length of longest continuous
increasing subsequence (subarray).
Example 1:
Input: [1,3,5,4,7] Output: 3 Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4.
Example 2:
Input: [2,2,2,2,2] Output: 1 Explanation: The longest continuous increasing subsequence is [2], its length is 1.
Note: Length of the array will not exceed 10,000.
A:
class Solution { public: int findLengthOfLCIS(vector<int>& nums) { int res = 0, begin = 0, end = 0; int n = nums.size(); while(begin < n) { if(end+1 <n && nums[end] < nums[end+1]) { ++end; }else{ begin= end+1; end=begin; } res = max(res, end-begin+1); } return res; } };
犯的错误在于, res 放在if() 里了。
No comments:
Post a Comment