Code Signal_练习题_Knapsack Light

Posted yd2018

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Code Signal_练习题_Knapsack Light相关的知识,希望对你有一定的参考价值。

You found two items in a treasure chest! The first item weighs weight1 and is worth value1, and the second item weighs weight2 and is worth value2. What is the total maximum value of the items you can take with you, assuming that your max weight capacity is maxW and you can‘t come back for the items later?

Note that there are only two items and you can‘t bring more than one item of each type, i.e. you can‘t take two first items or two second items.

Example

    • For value1 = 10weight1 = 5value2 = 6weight2 = 4, and maxW = 8, the output should be
      knapsackLight(value1, weight1, value2, weight2, maxW) = 10.

      You can only carry the first item.

    • For value1 = 10weight1 = 5value2 = 6weight2 = 4, and maxW = 9, the output should be
      knapsackLight(value1, weight1, value2, weight2, maxW) = 16.

      You‘re strong enough to take both of the items with you.

    • For value1 = 5weight1 = 3value2 = 7weight2 = 4, and maxW = 6, the output should be
      knapsackLight(value1, weight1, value2, weight2, maxW) = 7.

      You can‘t take both items, but you can take any of them.

 

我的解答:

def knapsackLight(value1, weight1, value2, weight2, maxW):
    dic = {weight1:value1, weight2:value2}
    if min(weight1, weight2) > maxW:
        return 0
    elif max(weight1, weight2) > maxW:
        return dic[min(weight1, weight2)]
    elif weight1 + weight2 > maxW:
        return max(value1, value2)
    else:
        return value1 + value2

 

技术分享图片
def knapsackLight(v1, w1, v2, w2, W):
    return max(int(w1 <= W) * v1, int(w2 <= W) * v2, int(w1 + w2 <= W) * (v1 + v2))


# 这都是些什么脑子...
膜拜大佬

 

以上是关于Code Signal_练习题_Knapsack Light的主要内容,如果未能解决你的问题,请参考以下文章

Code Signal_练习题_arrayChange

Code Signal_练习题_Minesweeper

Code Signal_练习题_stringsRearrangement

Code Signal_练习题_firstDigit

Code Signal_练习题_digitDegree

Code Signal_练习题_matrixElementsSum