class Solution {
public:
vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
int n=candies.size();
int maxCandies=*max_element(candies.begin(),candies.end());
vector<bool> ret;
for(int i=0;i<n;++i){
ret.push_back(candies[i]+extraCandies>=maxCandies);
}
return ret;
}
};
拥有最多糖果的孩子
最新推荐文章于 2024-07-08 22:12:26 发布