1431. 拥有最多糖果的孩子
public static void main(String[] args) {
System.out.println(kidsWithCandies(new int[]{2,3,5,1,3}, 3));
System.out.println(kidsWithCandies(new int[]{4,2,1,1,2}, 1));
System.out.println(kidsWithCandies(new int[]{12,1,12}, 10));
}
public static List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
int maxp = 0;
List<Boolean> result = new ArrayList<>();
maxp = findMaxValuePosition(candies, maxp);
for (int candy : candies) {
int t = extraCandies+candy;
if (t >= candies[maxp]) {
result.add(true);
}else{
result.add(false);
}
}
return result;
}
private static int findMaxValuePosition(int[] candies, int maxp) {
for (int i = 0; i < candies.length; i++) {
if (candies[i] > candies[maxp]) {
maxp = i;
}
}
return maxp;
}