最长连续递增序列

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        int n=nums.length;
        if(n==0) return 0;
        int res=1;
        int []f=new int[n];
        //f[i]截止到扫描到i最长升序长度
        f[0]=1;
        int len=1;
        for(int i=1;i<n;i++){
            if(nums[i]>nums[i-1]){
                f[i] = f[i-1]+1;
            }else{
                f[i]=1;
            }
           res= res > f[i]? res:f[i];
        }
        return res;
    }
}

优化后

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