原题依旧不贴了,很简单的睡前小甜点
辣鸡大王遍历做法
class Solution {
public:
vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
vector<bool> ans;
for(int i = 0;i<candies.size();i++){
int count = 0;
for(int j =0;j<candies.size();j++){
if(candies[i]+extraCandies >= candies[j]){
count +=1;
}
}
if(count == candies.size()){
ans.push_back(true);
}
else{
ans.push_back(false);
}
}
return ans;
}
};