-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGreatestCandies.js
More file actions
28 lines (26 loc) · 1012 Bytes
/
GreatestCandies.js
File metadata and controls
28 lines (26 loc) · 1012 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/**There are n kids with candies. You are given an integer array candies, where each candies[i] represents the
* number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that
* you have. Return a boolean array result of length n, where result[i] is true if, after giving the
* ith kid all the extraCandies, they will have the greatest number of candies among all the kids, or false
* otherwise. */
var kidsWithCandies = function (candies, extraCandies) {
let max = Math.max(...candies);
let arr = [];
for (let i in candies) {
if (candies[i] + extraCandies >= max) {
arr.push(true);
} else arr.push(false);
}
return arr;
};
//another way
var kidsWithCandies = function (candies, extraCandies) {
let arr = [];
for (let i in candies) {
candies[i] + extraCandies >= Math.max(...candies)
? arr.push(true)
: arr.push(false);
}
return arr;
};
console.log(kidsWithCandies([2, 3, 5, 1, 3], 3));