comefrom: <awangdev>Backpack_3.java
code: public int backPack(int m, int[] A) {
      	if (A == null || A.length < 0) {
      	    return 0;
      	}
      	int n = A.length;
      	boolean[][] dp = new boolean[n + 1][m + 1];
      	
      	dp[0][0] = true;
      	for (int j = 1; j <= m; j++) {
      	    dp[0][j] = false;
      	}
      	
      	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] |= dp[i - 1][j - A[i - 1]]; 
      	        }
      	    }
      	}
      	
      	for (int j = m; j >= 0; j--) {
      	    if (dp[n][j]) {
      	        return j;
      	    }
      	}
      	return 0;
      }
masked: public int sample_funcname ( int var_0 , int [ ] var_1 ) {
    if ( var_1 == null || var_1 . length < 0 ) {
      return 0 ;
    }
    int var_5 = var_1 . length ;
    boolean [ ] [ ] var_8 = new boolean [ var_5 + 1 ] [ var_0 + 1 ] ;
    var_8 [ 0 ] [ 0 ] = true ;
    for ( int var_9 = 1 ;
    var_9 <= var_0 ;
    var_9 ++ ) {
      var_8 [ 0 ] [ var_9 ] = false ;
    }
    for ( int var_10 = 1 ;
    var_10 <= var_5 ;
    var_10 ++ ) {
      for ( int var_9 = 0 ;
      var_9 <= var_0 ;
      var_9 ++ ) {
        var_8 [ var_10 ] [ var_9 ] = var_8 [ var_10 - 1 ] [ var_9 ] ;
        if ( var_9 - var_1 [ var_10 - 1 ] >= 0 ) {
          var_8 [ var_10 ] [ var_9 ] |= var_8 [ var_10 - 1 ] [ var_9 - var_1 [ var_10 - 1 ] ] ;
        }
      }
    }
    for ( int var_9 = var_0 ;
    var_9 >= 0 ;
    var_9 -- ) {
      if ( var_8 [ var_5 ] [ var_9 ] ) {
        return var_9 ;
      }
    }
    return 0 ;
  }
  