comefrom: <awangdev>Longest Increasing Continuous subsequence_1.java
code: public int longestIncreasingContinuousSubsequence(int[] A) {
          if (A == null || A.length == 0) {
              return 0;
          }
          int leftRun = 1;
          int rightRun = 1;
          int ans = 1;
          for (int i = 1; i < A.length; i++) {
              if (A[i] > A[i - 1]) {
                  leftRun++;
              } else {
                  leftRun = 1;
              }
              ans = Math.max(ans, leftRun);
          }
          for (int i = A.length - 2; i >= 0; i--) {
              if (A[i] > A[i + 1]) {
                  rightRun++;
              } else {
                  rightRun = 1;
              }
              ans = Math.max(ans, rightRun);
          }
          return ans;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return 0 ;
    }
    int var_1 = 1 ;
    int var_2 = 1 ;
    int var_3 = 1 ;
    for ( int var_4 = 1 ;
    var_4 < var_0 . length ;
    var_4 ++ ) {
      if ( var_0 [ var_4 ] > var_0 [ var_4 - 1 ] ) {
        var_1 ++ ;
      }
      else {
        var_1 = 1 ;
      }
      var_3 = Math . max ( var_3 , var_1 ) ;
    }
    for ( int var_4 = var_0 . length - 2 ;
    var_4 >= 0 ;
    var_4 -- ) {
      if ( var_0 [ var_4 ] > var_0 [ var_4 + 1 ] ) {
        var_2 ++ ;
      }
      else {
        var_2 = 1 ;
      }
      var_3 = Math . max ( var_3 , var_2 ) ;
    }
    return var_3 ;
  }
  