1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21

class Solution
{
public:
    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies)
    {
        int n = candies.size();
        std::vector<bool> res(n);

        // 找到当前糖果的最大值
        int max_candies = 0;
        for (int i = 0; i < n; ++i)
            max_candies = std::max(max_candies, candies[i]);

        // 判断每个孩子在获得额外糖果后是否能成为最多糖果的孩子之一
        for (int i = 0; i < n; ++i)
            if (candies[i] + extraCandies >= max_candies)
                res[i] = true;

        return res;
    }
};