leetcode 1431. Kids With the Greatest Number of Candies（python）

描述

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]

Note:

2 <= candies.length <= 100
1 <= candies[i] <= 100
1 <= extraCandies <= 50

解析

根据题意，已经有一群孩子拿着自己特定数量的糖果，另外有几颗糖，将这几颗糖给任意一个孩子，如果他的糖果是最多的那就将其标记为 True ，最后返回布尔数组。思路简单，只需要找到拥有这群孩子里谁的糖最多，将这个糖果数量记为 mx ，然后遍历每个孩子的糖果，只要加上另外的几颗糖能够大于等于 mx ，那就将这个孩子标记为 True ，否则标记标记为 False ，返回布尔数组即可。

解答

class Solution(object):
    def kidsWithCandies(self, candies, extraCandies):
        """
        :type candies: List[int]
        :type extraCandies: int
        :rtype: List[bool]
        """
        mx = max(candies)
        result = []
        for candie in candies:
            if candie+extraCandies>=mx:
                result.append(True)
            else:
                result.append(False)
        return result

运行结果

Runtime: 20 ms, faster than 93.51% of Python online submissions for Kids With the Greatest Number of Candies.
Memory Usage: 13.1 MB, less than 99.61% of Python online submissions for Kids With the Greatest Number of Candies.

原题链接：https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/