comefrom: <awangdev>674. Longest Continuous Increasing Subsequence_4.java
code: public int findLengthOfLCIS(int[] nums) {
          if (nums == null || nums.length == 0) return 0;
          int n = nums.length;
          int[] dp = new int[2];
          dp[0] = 1;
          int max = 1;
          for (int i = 1; i < n; i++) {
              dp[i%2] = 1;
              if (nums[i] > nums[i - 1]) dp[i%2] = Math.max(dp[i%2], dp[(i - 1)%2] + 1);
              max = Math.max(max, dp[i%2]);
          }
          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 ;
    int [ ] var_6 = new int [ 2 ] ;
    var_6 [ 0 ] = 1 ;
    int max = 1 ;
    for ( int var_9 = 1 ;
    var_9 < var_4 ;
    var_9 ++ ) {
      var_6 [ var_9 % 2 ] = 1 ;
      if ( var_0 [ var_9 ] > var_0 [ var_9 - 1 ] ) var_6 [ var_9 % 2 ] = Math . max ( var_6 [ var_9 % 2 ] , var_6 [ ( var_9 - 1 ) % 2 ] + 1 ) ;
      max = Math . max ( max , var_6 [ var_9 % 2 ] ) ;
    }
    return max ;
  }
  