【LeetCode 75】第三题(1431)拥有最多糖果的孩子

**第三题 (1431)**: 拥有最多糖果的孩子**问题描述**

给定一个数组 `candies` 和一个整数 `extraCandies`，其中 `candies[i]` 表示第 `i` 个孩子拥有的糖果数量。请找出能够获得至少 `extraCandies` 额外糖果的孩子的数量。

**示例1**

输入：`candies = [5,2,11,3,4,6,7,8]`, `extraCandies =3`
输出：`5`

**示例2**

输入：`candies = [5,2,11,3,4,6,7,8]`, `extraCandies =10`
输出：`1`

**示例3**

输入：`candies = [5,2,11,3,4,6,7,8]`, `extraCandies =15`
输出：`0`

**解决方案**

我们可以使用一个简单的循环来解决这个问题。对于每个孩子，我们检查是否能够获得至少 `extraCandies` 额外糖果。如果能，则将计数加一。

def kidsWithCandies(candies, extraCandies):
 """
 Returns the number of children who can get at least extraCandies more candies.

 Args:
 candies (list): A list of integers representing the number of candies each child has.
 extraCandies (int): The minimum number of extra candies a child should have.

 Returns:
 int: The number of children who can get at least extraCandies more candies.
 """
 count =0 for candy in candies:
 # Check if the current child can get at least extraCandies more candies if candy + extraCandies >= max(candies):
 count +=1 return count# Example usage:
candies = [5,2,11,3,4,6,7,8]
extraCandies =3print(kidsWithCandies(candies, extraCandies)) # Output:5candies = [5,2,11,3,4,6,7,8]
extraCandies =10print(kidsWithCandies(candies, extraCandies)) # Output:1candies = [5,2,11,3,4,6,7,8]
extraCandies =15print(kidsWithCandies(candies, extraCandies)) # Output:0