comefrom: <awangdev>Backpack_1.java
code: public int backPack(int m, int[] A) {
      	if (A == null || A.length < 0) {
      	    return 0;
      	}
      	int n = A.length;
      	int[][] dp = new int[n + 1][m + 1];
      	
      	for (int i = 1; i <= n; i++) {
      	    for (int j = 0; j <= m; j++) {
      	        dp[i][j] = dp[i - 1][j];
      	        if (j - A[i - 1] >= 0) { 
      	            dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - A[i - 1]] + A[i - 1]); 
      	        }
      	    }
      	}
      	
      	return dp[n][m];
      }
masked: public int sample_funcname ( int var_0 , int [ ] var_1 ) {
    if ( var_1 == null || var_1 . length < 0 ) {
      return 0 ;
    }
    int var_2 = var_1 . length ;
    int [ ] [ ] var_3 = new int [ var_2 + 1 ] [ var_0 + 1 ] ;
    for ( int var_4 = 1 ;
    var_4 <= var_2 ;
    var_4 ++ ) {
      for ( int var_5 = 0 ;
      var_5 <= var_0 ;
      var_5 ++ ) {
        var_3 [ var_4 ] [ var_5 ] = var_3 [ var_4 - 1 ] [ var_5 ] ;
        if ( var_5 - var_1 [ var_4 - 1 ] >= 0 ) {
          var_3 [ var_4 ] [ var_5 ] = Math . max ( var_3 [ var_4 ] [ var_5 ] , var_3 [ var_4 - 1 ] [ var_5 - var_1 [ var_4 - 1 ] ] + var_1 [ var_4 - 1 ] ) ;
        }
      }
    }
    return var_3 [ var_2 ] [ var_0 ] ;
  }
  