comefrom: <awangdev>Longest Increasing Subsequence_1.java
code: 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; 
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return 0 ;
    }
    int var_1 = var_0 . length ;
    int [ ] var_2 = new int [ var_1 ] ;
    int max = 0 ;
    for ( int var_3 = 0 ;
    var_3 < var_1 ;
    var_3 ++ ) {
      for ( int var_4 = 0 ;
      var_4 < var_3 ;
      var_4 ++ ) {
        if ( var_0 [ var_3 ] > var_0 [ var_4 ] ) {
          var_2 [ var_3 ] = Math . max ( var_2 [ var_3 ] , var_2 [ var_4 ] + 1 ) ;
        }
      }
      max = Math . max ( var_2 [ var_3 ] , max ) ;
    }
    return max + 1 ;
  }
  