1431. Kids With the Greatest Number of Candies

Description

Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has.

For each kid check if there is a way to distribute extraCandies among the kids such that he or she can have the greatest number of candies among them. Notice that multiple kids can have 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]

Constraints:

2 <= candies.length <= 100
1 <= candies[i] <= 100
1 <= extraCandies <= 50

My Solution

Source Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
class Solution {

    /**
     * @param Integer[] $candies
     * @param Integer $extraCandies
     * @return Boolean[]
     */
    function kidsWithCandies($candies, $extraCandies) {
        $results = array();
        $maxCandies = 0;
        $maxPosition = 0;
        $x = 0;
        
        //find maximum number of candies
        while($x < sizeof($candies)){
            if($candies[$x] >= $maxCandies){
                $maxCandies = $candies[$x];
                $maxPosition = $x;
            }
            
            $x++;
        }

        $x = 0;
        //go through and determine who has more than the maximum
        //when their the extra candies are added
        while($x < sizeof($candies)){
            if(($candies[$x] + $extraCandies) >= $maxCandies){
                $results[] = true;
            }
            else{
                $results[] = false;
            }
            
            $x++;
        }
        
        
        return $results;
    }
 }

Analysis

Usually I write my solutions in JavaScript but I decided to do PHP for this one.

My solution is basic. All we do is find the highest number of candies in $candies and determine which values in the array are greater than that number when added to $extraCandies.

The running time is simply O(n) as we are only iterating over the $candies array once. There is also a call to max() and I am assuming that also just iterates over the array and doesn't do anything special. My method was the first that came to mind but I can't think of a better algorithm to do this.