comefrom: <awangdev>Longest Increasing Continuous subsequence_3.java
code: public int longestIncreasingContinuousSubsequence(int[] A) {
          if (A == null || A.length == 0) {
              return -1;
          }
          int maxLength1 = 0;
          int maxLength2 = 0;
          int track = 1;
          for (int i = 1; i < A.length; i++) {
              if (A[i] > A[i - 1]) {
                  track++;
              } else {
                  maxLength1 = track > maxLength1 ? track : maxLength1;
                  track = 1;
              }
          }
          maxLength1 = track > maxLength1 ? track : maxLength1;
          track = 1;
          for (int i = A.length - 2; i >= 0; i--) {
              if (A[i] > A[i + 1]) {
                  track++;
              } else {
                  maxLength2 = track > maxLength2 ? track : maxLength2;
                  track = 1;
              }
          }
          maxLength2 = track > maxLength2 ? track : maxLength2;
          return maxLength1 > maxLength2 ? maxLength1 : maxLength2;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return - 1 ;
    }
    int var_1 = 0 ;
    int var_2 = 0 ;
    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_3 ++ ;
      }
      else {
        var_1 = var_3 > var_1 ? var_3 : var_1 ;
        var_3 = 1 ;
      }
    }
    var_1 = var_3 > var_1 ? var_3 : var_1 ;
    var_3 = 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_3 ++ ;
      }
      else {
        var_2 = var_3 > var_2 ? var_3 : var_2 ;
        var_3 = 1 ;
      }
    }
    var_2 = var_3 > var_2 ? var_3 : var_2 ;
    return var_1 > var_2 ? var_1 : var_2 ;
  }
  