【千里码】Task25-老王装货

最新推荐文章于 2024-05-13 13:15:00 发布

Y_pc

最新推荐文章于 2024-05-13 13:15:00 发布

阅读量745

点赞数

分类专栏：开发经验文章标签：背包问题

本文链接：https://blog.csdn.net/yu573017320/article/details/51966469

版权

开发经验专栏收录该内容

13 篇文章 0 订阅

订阅专栏

载重上限5t，求最大载重量的方案

虽然知道这是背包问题，对于算法一脸懵逼的我还是只能一个个遍历过去，源代码手贱删了，下面贴个评论区和我差不多思路的代码

public class Answer25 {

    static int good[] = {509, 838, 924, 650, 604, 793, 564, 651, 697, 649, 747, 787, 701, 605, 644};
    static int LIMIT = 5000;

    public static void main(String[] args) {
        int maxWeight = 0;
        String maxMethod = "";

        for (int i = 0; i < 1 << good.length; i++) {
            String method = Integer.toBinaryString(i);

            while (method.length() < good.length) {
                method = "0" + method;
            }
            int sum = 0;
            for (int j = 0; j < method.length(); j++) {
                if (method.charAt(j) == '1') {
                    sum += good[j];
                }
                if (sum > LIMIT) {
                    break;
                }
            }
            if (sum <= LIMIT && sum > maxWeight) {
                maxWeight = sum;
                maxMethod = method;
            }
        }
        String result = "";
        int resultWeight = 0;
        for (int j = 0; j < maxMethod.length(); j++) {
            if (maxMethod.charAt(j) == '1') {
                result += (j + 1) + "-";
                resultWeight += good[j];
            }
        }
        if (result.length() > 0) {
            result = result.substring(0, result.length() - 1);
        }
        System.out.println(result);
        System.out.println(resultWeight);
    }