leetcode_1431

문제

https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/description/?envType=study-plan-v2&envId=leetcode-75

python3

def solution(candies, extraCandies):
	# extraCandies를 한 아이에게 줬을 때 전체 아이들 중 가장 많이 캔디를 가지게 된다면 true, 아니면 false 
    
 	mostCandy = max(candies)
    answer = [False] * len(candies)
    
    for i in range(len(candies)):
    	answer[i] = True if candies[i] + extraCandies >= mostCandy else False
    
    return answer

java

import java.util.*;

public class no_1431 {
	public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
    	int mostCandy = 0;
        for(int i=0; i<candies.length; i++) {
        	mostCandy = Math.max(mostCandy, candies[i]);
        }
        
        List<Boolean> answer = new ArrayList<>();
        for(int i=0; i<candies.length; i++) {
            answer.add(candies[i] + extraCandies >= mostCandy ? true:false);
        }
            
        return answer;
    }
}