Leetcode 最长连续递增序列

package bad;

public class lEngth {
public int finfLengthof(int[] nums){
if(nums.length==0)
return 0;
int max_len=1;
int len=1;
for(int i=0;i<nums.length-1;i++){
if(nums[i]<nums[i+1]){
len++;
}else {
len=1;
}
max_len=Math.max(max_len,len);
}
return max_len;
}
public static void main (String[] args){
lEngth r=new lEngth();
int[] nums={1,3,5,4,7};
r.finfLengthof(nums);
System.out.println(r.finfLengthof(nums));
}
}