<awangdev>Longest Increasing Subsequence_1.java
public int lengthOfLIS(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        int n = nums.length;
        int[] dp = new int[n]; 
        int max = 0;
        
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < i; j++) {
                if (nums[i] > nums[j]) {
                    dp[i] = Math.max(dp[i], dp[j] + 1);
                }
            }
            max = Math.max(dp[i], max);
        }
        return max + 1; 
    }
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_5 = new int [ var_4 ] ;
  int max = 0 ;
  for ( int var_7 = 0 ;
  var_7 < var_4 ;
  var_7 ++ ) {
    for ( int var_8 = 0 ;
    var_8 < var_7 ;
    var_8 ++ ) {
      if ( var_0 [ var_7 ] > var_0 [ var_8 ] ) {
        var_5 [ var_7 ] = Math . max ( var_5 [ var_7 ] , var_5 [ var_8 ] + 1 ) ;
      }
    }
    max = Math . max ( var_5 [ var_7 ] , max ) ;
  }
  return max + 1 ;
}
