Leetcode 1431 - Kids With the Greatest Number of Candies - C++

Linguagem: C++

Solução:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

class Solution { public: vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) { int max = 0; vector<bool> result; for(int i = 0; i < candies.size(); i++){ if(candies.at(i)>max){ max = candies.at(i); } } for(int i = 0; i < candies.size(); i++){ if(candies.at(i) + extraCandies >= max){ result.push_back(true); } else{ result.push_back(false); } } return result; } };