1431. 拥有最多糖果的孩子
题解
class Solution {public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {// 找出最大值int max = candies[0];// 注意遍历从索引 1 开始for (int i = 1; i < candies.length; i++) {max = Math.max(candies[i], max);}// 先计算出达到最大值需要多少个糖果,减少做加法次数int minTarget = max - extraCandies;List<Boolean> resList = new ArrayList<>();for (int i = 0; i < candies.length; i++) {resList.add(candies[i] >= minTarget);}return resList;}}
