comefrom: <awangdev>674. Longest Continuous Increasing Subsequence_2.java
code: public int findLengthOfLCIS(int[] nums) {
          if (nums == null || nums.length == 0) return 0;
          int max = 1, size = 1;
          for (int i = 1; i < nums.length; i++) {
              if (nums[i] > nums[i - 1]) size++;
              else size = 1;
              max = Math.max(size, max);
          }
          return max;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) return 0 ;
    int max = 1 , var_6 = 1 ;
    for ( int var_7 = 1 ;
    var_7 < var_0 . length ;
    var_7 ++ ) {
      if ( var_0 [ var_7 ] > var_0 [ var_7 - 1 ] ) var_6 ++ ;
      else var_6 = 1 ;
      max = Math . max ( var_6 , max ) ;
    }
    return max ;
  }
  