leetcode 674:最长连续递增子序列
题目描述:求最长连续递增子序列,此题目不需要采用动态规划更好求解
代码:
public int findLengthOfLCIS(int[] nums) {
if(nums.length==0)
return 0;
int maxlen = 1;
int len = 1;
for (int i = 1; i < nums.length; i++) {
if(nums[i] > nums[i-1])
len++;
else
len = 1;
maxlen = Math.max(maxlen, len);
}
return maxlen;
}