comefrom: <qiyuangong>674_Longest_Continuous_Increasing_Subsequence_1.java
code: public int findLengthOfLCIS(int[] nums) {
          if (nums.length == 0) return 0;
          int curr = 1, ans = 1;
          for (int i = 0; i < nums.length - 1; i++) {
              if (nums[i] < nums[i + 1]) {
                  curr ++;
                  if (curr >= ans) ans = curr;
              } else {
                  curr = 1;
              }
          }
          return ans;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 . length == 0 ) return 0 ;
    int var_4 = 1 , var_5 = 1 ;
    for ( int var_6 = 0 ;
    var_6 < var_0 . length - 1 ;
    var_6 ++ ) {
      if ( var_0 [ var_6 ] < var_0 [ var_6 + 1 ] ) {
        var_4 ++ ;
        if ( var_4 >= var_5 ) var_5 = var_4 ;
      }
      else {
        var_4 = 1 ;
      }
    }
    return var_5 ;
  }
  