comefrom: <awangdev>674. Longest Continuous Increasing Subsequence_1.java
code: public int findLengthOfLCIS(int[] nums) {
          if (nums == null || nums.length == 0) return 0;
          int n = nums.length, windowStart = 0;
          int max = 1;
          for (int i = 1; i < n; i++) {
              if (nums[i] <= nums[i - 1]) windowStart = i;
              max = Math.max(max, i - windowStart + 1);
          }
          return max;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) return 0 ;
    int var_4 = var_0 . length , var_5 = 0 ;
    int max = 1 ;
    for ( int var_8 = 1 ;
    var_8 < var_4 ;
    var_8 ++ ) {
      if ( var_0 [ var_8 ] <= var_0 [ var_8 - 1 ] ) var_5 = var_8 ;
      max = Math . max ( max , var_8 - var_5 + 1 ) ;
    }
    return max ;
  }
  