Question
Given an unsorted array of integers, find the length of longest continuous increasing subsequence.
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.
问题解析:
给定数组,找到其中最长的连续递增的子数组序列,连续相等不算递增。
Answer
Solution 1:
遍历实现。
- 题目比较简单,通过记录最小和最大索引位置和当前最大长度,遍历实现即可。
class Solution {
public int findLengthOfLCIS(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int maxlength = 1;
int left = 0;
int right = 0;
for (int i = 0; i < nums.length-1; i++){
if (nums[i] < nums[i+1]){
right++;
maxlength = Math.max(maxlength, right-left+1);
}else{
left = right = i+1;
}
}
return maxlength;
}
}
- 时间复杂度:O(n),空间复杂度:O(1)