Leetcode 455. Assign Cookies[easy]
2016-11-16 15:00
459 查看
题目:
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.
贪心。
明显先满足greed值低的小孩最划算,且用s尽可能小的糖去满足小孩不会使的结果更差。
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.
贪心。
明显先满足greed值低的小孩最划算,且用s尽可能小的糖去满足小孩不会使的结果更差。
class Solution { public: int findContentChildren(vector<int>& g, vector<int>& s) { sort(g.begin(), g.end()); sort(s.begin(), s.end()); int p = 0; int ans = 0; for (int i = 0; i < g.size(); i++) { while (p < s.size() && s[p] < g[i]) p++; if (p == s.size()) break; p++; ans++; } return ans; } };
相关文章推荐
- 【leetcode】【Easy】【455. Assign Cookies】【greedy】
- LeetCode解题报告 455. Assign Cookies [easy]
- leetcode-455. Assign Cookies
- LeetCode-455. Assign Cookies
- 【LeetCode】 455. Assign Cookies
- Leetcode-455. Assign Cookies
- 【leetcode】455. Assign Cookies
- 【算法作业9】LeetCode 455. Assign Cookies
- leetcode 455. Assign Cookies(C语言,堆排序)28
- leetcode_455. Assign Cookies 分配饼干,java数组的排序
- 【Leetcode】455. Assign Cookies
- 455. Assign Cookies - Easy
- 【leetcode】455. Assign Cookies【E】
- [leetcode] 455. Assign Cookies 解题报告
- LeetCode 455. Assign Cookies
- 第五周:[Leetcode]455. Assign Cookies
- LeetCode455. Assign Cookies
- LeetCode--455. Assign Cookies
- leetcode 455. Assign Cookies 饼干满足问题 + 一个简单的归并过程
- Leetcode:455. Assign Cookies