1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
| class Solution {
public int kItemsWithMaximumSum(int numOnes, int numZeros, int numNegOnes, int k) {
int maxSum = 0;
if (k > numOnes) {
maxSum += numOnes;
k -= numOnes;
} else {
maxSum += k;
return maxSum;
}
if (k > numZeros) {
k -= numZeros;
} else {
return maxSum;
}
return maxSum - k;
}
}
|
References
2600. K Items With the Maximum Sum