01背包一维数组

public class testWeightBagProblem1 {
    public static void main(String[] args) {
        Solution solution = new testWeightBagProblem1().new Solution();
        int[] weight = {1,3,4};
        int[] value = {15,20,30};
        int bagSize = 4;
        int count = solution.testWeightBagProblem1(weight,value,bagSize);
        return ;
    }
    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public int testWeightBagProblem1(int[] weight, int[] value, int bagWeight) {
            int wLen = weight.length;
            //定义dp数组：dp[j]表示背包容量为j时，能获得的最大价值
            int[] dp = new int[bagWeight + 1];
            //遍历顺序：先遍历物品，再遍历背包容量
            for (int i = 0; i < wLen; i++){
                for (int j = bagWeight; j >= weight[i]; j--){
                    //逆序才能拿到上一轮的背包数据，正序只能计算本轮背包不断加塞的数据
                    //举例子：对于二位数组来说，当前层是需要上一层的数据和左上角的数据 来Max比较求大
                    //如果是正序遍历则dp[j]是累加的结果。倒着遍历则不会
                    dp[j] = Math.max(dp[j], dp[j - weight[i]] + value[i]);
                }
            }

            return dp[bagWeight];
        }
    }
//leetcode submit region end(Prohibit modification and deletion)
}