class Solution {
public:
vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
vector<bool> res;
int maxNum = *max_element(candies.begin(), candies.end());
for(int i = 0; i < candies.size(); i++)
{
if(candies[i] + extraCandies >= maxNum)
{
res.push_back(true);
}
else
{
res.push_back(false);
}
}
return res;
}
};
leetcode | 1431. 拥有最多糖果的孩子
最新推荐文章于 2023-09-14 17:08:17 发布