LeetCode知识点总结 - 2600

LeetCode 2600. K Items With the Maximum Sum

考点	难度
Greedy	Easy

题目

There is a bag that consists of items, each item has a number 1, 0, or -1 written on it.

You are given four non-negative integers numOnes, numZeros, numNegOnes, and k.

The bag initially contains:

numOnes items with 1s written on them.
numZeroes items with 0s written on them.
numNegOnes items with -1s written on them.
We want to pick exactly k items among the available items. Return the maximum possible sum of numbers written on the items.

思路

只需要numones和numzeros。如果numones + numzeros不够，用k - numZeros - numOnes个-1补上。

答案

class Solution(object):
    def kItemsWithMaximumSum(self, numOnes, numZeros, numNegOnes, k):
        return min(k, numOnes) - max(0, k - numZeros - numOnes)