程式語言 - LeetCode - CPP - 1431. Kids With the Greatest Number of Candies

題目：


解答：

class Solution {
public:
    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
        vector<bool> ret;
        int max_num = *std::max_element(candies.begin(), candies.end());

        for (int i = 0; i < candies.size(); i++) {
            ret.push_back((candies[i] + extraCandies) >= max_num ? true : false);
        }

        return ret;
    }
};