-
Notifications
You must be signed in to change notification settings - Fork 33
/
455-Assign-Cookies.js
53 lines (45 loc) · 1.61 KB
/
455-Assign-Cookies.js
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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
/**
* https://leetcode.com/problems/assign-cookies/description/
* Difficulty:Easy
*
* Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.
*
* Note:
* You may assume the greed factor is always positive.
* You cannot assign more than one cookie to one child.
* Example 1:
* Input: [1,2,3], [1,1]
* Output: 1
* Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3.
* And even though you have 2 cookies, since their size is both 1, you could only make the child whose greed factor is 1 content.
* You need to output 1.
*
*/
/**
* @param {number[]} g
* @param {number[]} s
* @return {number}
*/
var findContentChildren = function (g, s) {
var ret = 0;
g.sort((a, b) => a - b);
s.sort((a, b) => a - b);
var gIndex = 0;
var sIndex = 0;
while (gIndex < g.length && sIndex < s.length) {
var gi = g[gIndex];
var si = s[sIndex];
if (gi <= si) {
ret += 1;
gIndex++;
sIndex++;
} else if (gi > si) {
sIndex++;
} else {
break;
}
}
return ret;
};
console.log(findContentChildren([1, 2, 3], [1, 1]));
console.log(findContentChildren([1,2], [1,2,3]));