LeetCode 455. Assign Cookies
2016-11-17 04:25
447 查看
原题网址:https://leetcode.com/problems/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 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:
Example 2:
方法:排序。
public class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int content = 0;
for(int i = 0; i < s.length && content < g.length; i++) {
if (g[content] <= s[i]) {
content++;
}
}
return content;
}
}
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.
Example 2:
Input: [1,2], [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.
方法:排序。
public class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int content = 0;
for(int i = 0; i < s.length && content < g.length; i++) {
if (g[content] <= s[i]) {
content++;
}
}
return content;
}
}
相关文章推荐
- Leetcode 455. Assign Cookies
- leetcode 455. Assign Cookies(C语言,堆排序)28
- 第五周:[Leetcode]455. Assign Cookies
- LeetCode455. Assign Cookies
- [leetcode: Python]455. Assign Cookies
- Leetcode:455. Assign Cookies (week 7)
- [leetcode] 455. Assign Cookies
- Leetcode 455. Assign Cookies
- 【LeetCode】455. Assign Cookies
- [leetcode]: 455. Assign Cookies
- LeetCode 455. Assign Cookies(数组,排序)
- Leetcode-455. Assign Cookies
- Leetcode:455. Assign Cookies
- Leetcode-455. Assign Cookies
- 算法4: leetcode 455. Assign Cookies
- leetcode :455. Assign Cookies
- LeetCode-Greedy-455. Assign Cookies
- [leetcode]455. Assign Cookies
- 【leetcode】455. Assign Cookies【E】
- Leetcode 455. Assign Cookies[easy]