<gouthampradhan>array_LongestIncreasingSubsequence_1.java
public int findLengthOfLCIS(int[] nums) {
    int max = 1, count = 1;
    if (nums.length == 1) return max;
    if (nums.length == 0) return 0;
    for (int i = 0, j = i + 1; j < nums.length; ) {
      if (nums[j] > nums[i]) {
        count++;
        i++;
        j++;
      } else {
        max = Math.max(max, count);
        count = 0;
        i = j;
        j = i + 1;
      }
    }
    return max;
  }
public int sample_funcname ( int [ ] var_0 ) {
  int max = 1 , var_3 = 1 ;
  if ( var_0 . length == 1 ) return max ;
  if ( var_0 . length == 0 ) return 0 ;
  for ( int var_6 = 0 , var_7 = var_6 + 1 ;
  var_7 < var_0 . length ;
  ) {
    if ( var_0 [ var_7 ] > var_0 [ var_6 ] ) {
      var_3 ++ ;
      var_6 ++ ;
      var_7 ++ ;
    }
    else {
      max = Math . max ( max , var_3 ) ;
      var_3 = 0 ;
      var_6 = var_7 ;
      var_7 = var_6 + 1 ;
    }
  }
  return max ;
}
