题目来源
https://leetcode-cn.com/problems/kids-with-the-greatest-number-of-candies/
题目描述
题目解析
public class EcmDef {
public static List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
List<Boolean> list = new ArrayList<>();
// 找出最大
int max = candies[0];
for (int i = 1; i < candies.length; i++){
if (candies[i] > max){
max = candies[i];
}
}
// 循环数组,每个数组加上额外,如果大于等于max,就是需要的
for (int i = 0; i < candies.length; i++){
if (candies[i] + extraCandies >= max){
list.add(true);
continue;
}
list.add(false);
}
return list;
}
public static void main(String[] args) {
System.out.println( kidsWithCandies(new int[]{12,1,12},10));
}
}
class Solution {
public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
int max = Arrays.stream(candies).max().getAsInt();
List<Boolean> result = new ArrayList<>(candies.length);
for (int candy : candies) {
result.add((candy + extraCandies) >= max);
}
return result;
}
}