Leetcode Algorithm 1431

박영호·2021년 3월 25일
post-thumbnail

1431 Kids With the Greatest Number of Candies

Example 1

Input: candies = [2,3,5,1,3], extraCandies = 3
Output: [true,true,true,false,true]
Explanation:
Kid 1 has 2 candies and if he or she receives all extra candies (3) will have 5 candies --- the greatest number of candies among the kids.
Kid 2 has 3 candies and if he or she receives at least 2 extra candies will have the greatest number of candies among the kids.
Kid 3 has 5 candies and this is already the greatest number of candies among the kids.
Kid 4 has 1 candy and even if he or she receives all extra candies will only have 4 candies.
Kid 5 has 3 candies and if he or she receives at least 2 extra candies will have the greatest number of candies among the kids.

Example 2

Input: candies = [4,2,1,1,2], extraCandies = 1
Output: [true,false,false,false,false]
Explanation: There is only 1 extra candy, therefore only kid 1 will have the greatest number of candies among the kids regardless of who takes the extra candy.

Example 3

Input: candies = [12,1,12], extraCandies = 10
Output: [true,false,true]

result

var kidsWithCandies = function(candies, extraCandies) {
    let array= [];
    let maxNum = Math.max(...candies);
 
    for(let i =0; i < candies.length; i++) {
      if(extraCandies + candies[i] >= maxNum){
        array.push(true);
      } else {
        array.push(false)
      }
    }
    return array;
};
profile
무언가에 호기심이 생기면 적극적이고 재밌게 그걸 해결해내고 싶어하는 프론트 엔드 개발자 입니다 .

0개의 댓글