greedy——455. Assign Cookies
来源:互联网 发布:数据库设计视图格式 编辑:程序博客网 时间:2024/06/14 07:17
题目描述
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: 1Explanation: 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.
比较两个数组,当饼干数组的某个元素>= 孩子需要的,就可以分给小孩
解题思路
给两个数组排序,设置计数器,遍历两个数组,判断是否能分给饼干,能的话,计数器+1
代码如下
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 count = 0;for(int i = 0; i < g.size(); i++){int j = p;for(j; j < s.size(); j++){if(s[j] >= g[i]){p = j + 1;count++;break;}}}return count; }};
0 0
- greedy——455. Assign Cookies
- LeetCode-Greedy-455. Assign Cookies
- LeetCode-Greedy-455. Assign Cookies
- 455.Assign Cookies | LeetCode Greedy
- 【greedy】LeetCode----455. Assign Cookies
- 455. Assign Cookies(greedy)
- 【leetcode】【Easy】【455. Assign Cookies】【greedy】
- greedy: 55. Jump Game \ 455. Assign Cookies
- LeetCode 455. Assign Cookies
- 455. Assign Cookies
- Leetcode-455. Assign Cookies
- 455. Assign Cookies
- 455. Assign Cookies
- LeetCode 455. Assign Cookies
- 455. Assign Cookies
- 【LeetCode】455. Assign Cookies
- leetcode 455. Assign Cookies
- 455. [LeetCode]Assign Cookies
- ZOJ Problem Set
- 常用生物信息学格式介绍
- “Ipad is disabled”解决方法(Ipad系统重装)
- 使用WebStorm的Macros宏指令,实现保存的同时格式化代码,并跳至行尾
- JNDI数据源
- greedy——455. Assign Cookies
- http://blog.csdn.net/chenggong2dm/article/details/7896440
- Hibernate中的多表操作
- MySQL 5.6 if与end if在触发器中的使用
- 青铜莲花池(bfs)
- Codeforces 798D Mike and distribution 构造
- LeetCode 64. Minimum Path Sum
- PageHelper插件的使用方法
- C#winform实现增删改查