<awangdev>Longest Increasing Continuous subsequence_1.java
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;
    }
public int sample_funcname ( int [ ] var_0 ) {
  if ( var_0 == null || var_0 . length == 0 ) {
    return 0 ;
  }
  int var_5 = 1 ;
  int var_6 = 1 ;
  int var_7 = 1 ;
  for ( int var_8 = 1 ;
  var_8 < var_0 . length ;
  var_8 ++ ) {
    if ( var_0 [ var_8 ] > var_0 [ var_8 - 1 ] ) {
      var_5 ++ ;
    }
    else {
      var_5 = 1 ;
    }
    var_7 = Math . max ( var_7 , var_5 ) ;
  }
  for ( int var_8 = var_0 . length - 2 ;
  var_8 >= 0 ;
  var_8 -- ) {
    if ( var_0 [ var_8 ] > var_0 [ var_8 + 1 ] ) {
      var_6 ++ ;
    }
    else {
      var_6 = 1 ;
    }
    var_7 = Math . max ( var_7 , var_6 ) ;
  }
  return var_7 ;
}
