题目描述
解法:(C++)
没啥特别好说的,一趟遍历就可以了
class Solution {
public:
vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
int n = candies.size();
int mmax = -1;
vector<bool> res;
for(int i=0;i<n;i++)
mmax = candies[i]>mmax?candies[i]:mmax;
for(int i=0;i<n;i++)
{
if(candies[i]+extraCandies>=mmax) res.push_back(true);
else res.push_back(false);
}
return res;
}
};