LeetCode-Easy-Java-Longest Continuous Increasing Subsequence

找到一个数组中连续增长的最大长度

题目描述：

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.

解决思路：

！！！首先一定要先判断是否为空，空则返回0；

然后从第一位循环判断是否当前数比下一个数小，如果小则长度+1；

如果大于或等于则重置长度值，重新计算；（！！！等于也不属于递增情况）

结果值最终取得最大的长度值。

class Solution {
public int findLengthOfLCIS(int[] nums) {
if(nums.length==0){
return 0;
}
int result=1;
int len=1;
for(int i=0;i<nums.length-1;i++){
if(nums[i]<nums[i+1]){
len=len+1;
}else{
len=1;
}
if(result<len){
result=len;
}
}

return result;
}
}

更多算法知识点 关注FunctionY csdn博客哦！