comefrom: <gouthampradhan>dynamic_programming_LongestIncreasingSubsequence_1.java
code: public int lengthOfLIS(int[] nums) {
      if (nums.length == 0) return 0;
      int[] A = new int[nums.length];
      int max = Integer.MIN_VALUE;
      for (int i = 0, l = nums.length; i < l; i++) {
        int lis = 1;
        for (int j = 0; j < i; j++) {
          if (nums[i] > nums[j]) lis = Math.max(lis, A[j] + 1);
        }
        A[i] = lis;
        max = Math.max(max, A[i]);
      }
      return max;
    }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 . length == 0 ) return 0 ;
    int [ ] var_1 = new int [ var_0 . length ] ;
    int max = Integer . MIN_VALUE ;
    for ( int var_2 = 0 , var_3 = var_0 . length ;
    var_2 < var_3 ;
    var_2 ++ ) {
      int var_4 = 1 ;
      for ( int var_5 = 0 ;
      var_5 < var_2 ;
      var_5 ++ ) {
        if ( var_0 [ var_2 ] > var_0 [ var_5 ] ) var_4 = Math . max ( var_4 , var_1 [ var_5 ] + 1 ) ;
      }
      var_1 [ var_2 ] = var_4 ;
      max = Math . max ( max , var_1 [ var_2 ] ) ;
    }
    return max ;
  }
  