Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has.
For each kid check if there is a way to distribute extraCandies among the kids such that he or she can have the greatest number of candies among them. Notice that multiple kids can have the greatest number of candies.
Example 1:
Input: candies = [2,3,5,1,3], extraCandies = 3 Output: [true,true,true,false,true] Explanation: Kid 1 has 2 candies and if he or she receives all extra candies (3) will have 5 candies --- the greatest number of candies among the kids. Kid 2 has 3 candies and if he or she receives at least 2 extra candies will have the greatest number of candies among the kids. Kid 3 has 5 candies and this is already the greatest number of candies among the kids. Kid 4 has 1 candy and even if he or she receives all extra candies will only have 4 candies. Kid 5 has 3 candies and if he or she receives at least 2 extra candies will have the greatest number of candies among the kids.
Example 2:
Input: candies = [4,2,1,1,2], extraCandies = 1 Output: [true,false,false,false,false] Explanation: There is only 1 extra candy, therefore only kid 1 will have the greatest number of candies among the kids regardless of who takes the extra candy.
Example 3:
Input: candies = [12,1,12], extraCandies = 10 Output: [true,false,true]
Constraints:
2 <= candies.length <= 1001 <= candies[i] <= 1001 <= extraCandies <= 50
Solution: Finding max
Find the maximum candies that a kid has.
ans[i] = (candies[i] + extra) >= max_candies
Time complexity: O(n)
Space complexity: O(1)
C++
|
1 2 3 4 5 6 7 8 9 10 11 |
// Author: Huahua class Solution { public: vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) { const int threshold = *max_element(begin(candies), end(candies)); vector<bool> ans(candies.size()); for (int i = 0; i < candies.size(); ++i) ans[i] = (candies[i] + extraCandies) >= threshold; return ans; } }; |
Python
|
1 2 3 4 5 |
# Author: Huahua class Solution: def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]: m = max(candies) return [c + extraCandies >= m for c in candies] |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Paypal
Venmo
huahualeetcode
huahualeetcode
微信打赏
Be First to Comment