声明:原题目转载自LeetCode,解答部分为原创
Problem:
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.
Solution:
思路:贪心算法,每次分配均从未分配的数组中需求量最小的开始,确保预留下来的饼干有最大的剩余分配价值。
代码如下:
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(), g.end());
sort(s.begin(), s.end());
int command_num = 0;
int s_pointer = 0;
for(int i = 0 ; i < g.size() ; i ++ )
{
int j;
for(j = s_pointer ; j < s.size() ; j ++)
{
if(s[j] >= g[i])
{
command_num ++;
s_pointer = j + 1;
break;
}
}
if(j == s.size())
break;
}
return command_num;
}
};
int main()
{
Solution text;
vector<int> g, s;
g.push_back(1);
g.push_back(2);
g.push_back(3);
s.push_back(1);
s.push_back(1);
cout << text.findContentChildren(g, s) << endl;
return 0;
}