comefrom: <awangdev>Backpack_2.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[2][m + 1];
      	
      	for (int i = 1; i <= n; i++) {
      	    for (int j = 0; j <= m; j++) {
      	        dp[i % 2][j] = dp[(i - 1) % 2][j];
      	        if (j - A[i - 1] >= 0) { 
      	            dp[i % 2][j] = Math.max(dp[i % 2][j], dp[(i - 1) % 2][j - A[i - 1]] + A[i - 1]); 
      	        }
      	    }
      	}
      	return dp[n % 2][m];
      }
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 ;
    int [ ] [ ] var_8 = new int [ 2 ] [ var_0 + 1 ] ;
    for ( int var_9 = 1 ;
    var_9 <= var_5 ;
    var_9 ++ ) {
      for ( int var_10 = 0 ;
      var_10 <= var_0 ;
      var_10 ++ ) {
        var_8 [ var_9 % 2 ] [ var_10 ] = var_8 [ ( var_9 - 1 ) % 2 ] [ var_10 ] ;
        if ( var_10 - var_1 [ var_9 - 1 ] >= 0 ) {
          var_8 [ var_9 % 2 ] [ var_10 ] = Math . max ( var_8 [ var_9 % 2 ] [ var_10 ] , var_8 [ ( var_9 - 1 ) % 2 ] [ var_10 - var_1 [ var_9 - 1 ] ] + var_1 [ var_9 - 1 ] ) ;
        }
      }
    }
    return var_8 [ var_5 % 2 ] [ var_0 ] ;
  }
  