class Solution {
public int findLengthOfLCIS(int[] nums) {
int length=0;
int tmp=1;
if(nums.length==0) return 0;
for(int i=0; i<nums.length1;i++){
if(nums[i]<nums[i+1]) {tmp++; length=Math.max(length,tmp); }
if(nums[i]>=nums[i+1]) {tmp=1;}
}
return Math.max(length,1);
}
}
Java code6 liner


@DennisHua u r the best stack king. U will must set up a top500 company in the world!
