comefrom: <awangdev>Backpack V_1.java
code: public int backPackV(int[] nums, int target) {
          if (nums == null || nums.length == 0) {
              return 0;
          }
          int n = nums.length;
          int[][] dp = new int[n + 1][target + 1];
          dp[0][0] = 1; 
          for (int j = 1; j <= target; j++) {
              dp[0][j] = 0;
          }
  
          for (int i = 1; i <= n; i++) {
              for  (int j = 0; j <= target; j++) {
                  dp[i][j] = dp[i - 1][j];
                  if (j - nums[i - 1] >= 0) {
                      dp[i][j] += dp[i - 1][j - nums[i - 1]];    
                  }
              }
          }
          return dp[n][target];
      }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return 0 ;
    }
    int var_5 = var_0 . length ;
    int [ ] [ ] var_7 = new int [ var_5 + 1 ] [ var_1 + 1 ] ;
    var_7 [ 0 ] [ 0 ] = 1 ;
    for ( int var_8 = 1 ;
    var_8 <= var_1 ;
    var_8 ++ ) {
      var_7 [ 0 ] [ var_8 ] = 0 ;
    }
    for ( int var_9 = 1 ;
    var_9 <= var_5 ;
    var_9 ++ ) {
      for ( int var_8 = 0 ;
      var_8 <= var_1 ;
      var_8 ++ ) {
        var_7 [ var_9 ] [ var_8 ] = var_7 [ var_9 - 1 ] [ var_8 ] ;
        if ( var_8 - var_0 [ var_9 - 1 ] >= 0 ) {
          var_7 [ var_9 ] [ var_8 ] += var_7 [ var_9 - 1 ] [ var_8 - var_0 [ var_9 - 1 ] ] ;
        }
      }
    }
    return var_7 [ var_5 ] [ var_1 ] ;
  }
  