describe

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: candie's =,3,5,1,3 [2], 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.Copy the code

Example 2:

Input: candie's =,2,1,1,2 [4], 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.Copy the code

Example 3:

Input: candie = [12,1,12], extraCandies = 10Copy the code

Note:

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

parsing

Give the candies to any child, mark it True if he has the most candies, and return the Boolean array. Find out who has the most candy in this group, mark the number of candies as MX, and then go through each child’s candy. If you add a few more candies that can be greater than or equal to MX, mark the child as True, otherwise mark it as False, and return a Boolean array.

answer

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
        	      
		
Copy the code

The results

Runtime: 10 ms, faster than 93.51% of Python online submissions for Kids With the Greatest Number of Candies. Memory Usage: Each of the Python online submissions for Kids With the Greatest Number of Candies.Copy the code

Original link: leetcode.com/problems/ki…

Your support is my biggest motivation