[LeetCode]455. Assign Cookies
2017-01-04 00:41
417 查看
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.
题目链接:https://leetcode.com/problems/assign-cookies/
贪心,先满足需求比较小的,一遍循环即可。
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.
题目链接:https://leetcode.com/problems/assign-cookies/
贪心,先满足需求比较小的,一遍循环即可。
class Solution { public: int findContentChildren(vector<int>& g, vector<int>& s) { sort(g.begin(),g.end()); sort(s.begin(),s.end()); int i,j,n=g.size(),m=s.size(); for(i=0,j=0;i<n&&j<m;j++){ if(g[i]<=s[j]){ i++; } } return i; } };
相关文章推荐
- [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]
- Leetcode 455. Assign Cookies 分蛋糕 解题报告
- LeetCode-Greedy-455. Assign Cookies
- LeetCode 455. Assign Cookies
- 【算法作业9】LeetCode 455. Assign Cookies
- LeetCode--455. Assign Cookies
- leetcode_455. Assign Cookies 分配饼干,java数组的排序