1431. Kids With the Greatest Number of Candies
给你一个阵列 candies ，candies [i] 表示第 i 个小孩有的糖果数量，再给你一个整数
extraCandies 表示额外糖果，返回一个 Boolean 列表，他的值为：
若额外糖果全给第 i 个小孩第 i 个小孩的糖果数量会是所有人之中最多的。
Example:
Input: candies = [2,3,5,1,3], extraCandies = 3
Output: [true,true,true,false,true]
Explanation: If you give all extraCandies to:
- Kid 1, they will have 2 + 3 = 5 candies, which is the greatest among the
kids.
- Kid 2, they will have 3 + 3 = 6 candies, which is the greatest among the
kids.
- Kid 3, they will have 5 + 3 = 8 candies, which is the greatest among the
kids.
- Kid 4, they will have 1 + 3 = 4 candies, which is not the greatest among
the kids.
- Kid 5, they will have 3 + 3 = 6 candies, which is the greatest among the
kids.
Input: candies = [4,2,1,1,2], extraCandies = 1
Output: [true,false,false,false,false]
Explanation: There is only 1 extra candy.
Kid 1 will always have the greatest number of candies, even if a different
kid is given the extra candy.
思路：
1.遍历第一次找出所有小孩中最大的糖果数量。
2.遍历第二次找出加上额外糖果后，是否会比小孩中最大的糖果数量还多，并设定
相应的 Boolean 值。
Java Code：