Kids With the Greatest Number of Candies — LeetCode 1431 Python Solution

The problem

There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have.

Example

Input

candies = [2,3,5,1,3], extraCandies = 3

Output

[true,true,true,false,true]

Explanation

If you give all extraCandies to:

Python solution

class Solution:
    def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]:
        mx = max(candies)
        return [candy + extraCandies >= mx for candy in candies]

Complexity

Related problems