Algorithm
Problem Name: 455. Assign Cookies
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 g[i], which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s[j]. If s[j] >= g[i], 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.
Example 1:
Input: g = [1,2,3], s = [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.
Example 2:
Input: g = [1,2], s = [1,2,3] Output: 2 Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2. You have 3 cookies and their sizes are big enough to gratify all of the children, You need to output 2.
Constraints:
1 <= g.length <= 3 * 1040 <= s.length <= 3 * 1041 <= g[i], s[j] <= 231 - 1
Code Examples
#1 Code Example with Java Programming
Code -
Java Programming
class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int gIdx = 0;
int sIdx = 0;
while (sIdx < s.length && gIdx < g.length) {
if (s[sIdx] >= g[gIdx]) {
gIdx++;
}
sIdx++;
}
return gIdx;
}
}
Input
Output
#2 Code Example with Javascript Programming
Code -
Javascript Programming
const findContentChildren = function(g, s) {
s.sort((a, b) => a - b);
g.sort((a, b) => a - b);
let i = 0;
for (let j = 0; i < g.length && j < s.length; j++) {
if (g[i] <= s[j]) i++;
}
return i;
};
Input
Output
#3 Code Example with Python Programming
Code -
Python Programming
class Solution:
def findContentChildren(self, g, s):
g.sort(reverse = True); s.sort(reverse = True); res = 0
while s and g:
if g[-1] < = s[-1]: res += 1; g.pop(); s.pop()
else: s.pop()
return res
Input
Output
#4 Code Example with C# Programming
Code -
C# Programming
using System;
namespace LeetCode
{
public class _0455_AssignCookies
{
public int FindContentChildren(int[] g, int[] s)
{
Array.Sort(g);
Array.Sort(s);
var child = 0;
for (int cookie = 0; cookie < s.Length && child < g.Length; cookie++)
{
if (g[child] <= s[cookie])
child++;
}
return child;
}
}
}
Input
Output