01背包问题

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class OneZeroBag {
    public static class Item{
        char name;
        int weight;
        int value;

        public Item(char name, int weight, int value) {
            this.name = name;
            this.weight = weight;
            this.value = value;
        }

        @Override
        public String toString() {
            return "Item{" +
                    "name=" + name +
                    ", weight=" + weight +
                    ", value=" + value +
                    '}';
        }
    }

    public static int get01PackageMaxValue(List<Item> items, int capacity, List<Item> selectedItems){
        int[][] dp = new int[items.size()+1][capacity+1];
        for(int[] dpi : dp) {
            Arrays.fill(dpi, 0);
        }

        boolean[] selected = new boolean[items.size()];
        Arrays.fill(selected, false);

        for(int currCapacity = 1; currCapacity <= capacity; currCapacity++){
            for(int i = 0; i < items.size(); i++){
                int currItemIndex = i + 1;
                Item currItem = items.get(i);
                if(currItem.weight <= currCapacity){
                    dp[currItemIndex][currCapacity] = Math.max(dp[currItemIndex-1][currCapacity-currItem.weight] + currItem.value,
                                                               dp[currItemIndex-1][currCapacity]);

                }else {
                    dp[currItemIndex][currCapacity] = dp[currItemIndex-1][currCapacity];
                }
            }
        }

        System.out.println("二维数组:");
        for(int[] arr : dp){
            System.out.println(Arrays.toString(arr));
        }

       int capacityTemp = capacity;
        for (int k = items.size()-1; k >= 0; k--){
            Item item = items.get(k);
            int index = k+1;
            if(dp[index][capacityTemp] == dp[index-1][capacityTemp-item.weight] + item.value){
                capacityTemp -= item.weight;
                selectedItems.add(item);
            }
        }
        return dp[items.size()][capacity];
    }

    public static void main(String[] args){
        List<Item> items = new ArrayList<>(Arrays.asList(new Item('a', 2, 6),
                                                        new Item('b', 2, 3),
                                                        new Item('c', 6, 5),
                                                        new Item('d', 5, 4),
                                                        new Item('e', 4, 6)));
        List<Item> selectedItems = new ArrayList<>();
        int maxValue = get01PackageMaxValue(items, 10, selectedItems);
        System.out.println("max value:" + maxValue);
        System.out.println("selected items:" + selectedItems);
    }
}

参考资料写的很好:
http://blog.csdn.net/wumuzi520/article/details/7014559
http://blog.csdn.net/mu399/article/details/7722810

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值