445[Easy]:Assign Cookies

Part1:题目描述

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.

Part2:解题思路

因为这道题目的分类是贪心算法，首先就想着先找这道题的贪心策略。我解这道题想到的策略是：每次满足孩子的cookie的size都选满足条件里的最小的，那么剩下的cookie就有可能满足更多孩子。具体实现的时候，我用了algorithm函数库里的sort函数先给2个vector数组排序，在利用一个2重循环来势来实现给每个孩子的cookie都是当前能满足他的贪心因子的可选cookie中size最小的。

Part3:代码（leetcode上已经通过）

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int findContentChildren(vector<int>& g, vector<int>& s) {
	sort(g.begin(), g.end());
	sort(s.begin(), s.end());
	int result = 0;
	vector<int>::iterator it;
	for (int i = 0; i < s.size(); i++) {
		for (int j = 0; j < g.size(); j++) {
			it = g.begin();
		    if (s[i] >= g[j]) {
			    result++;
			    it += j;
			    // 移出被满足的孩子
				// earse是使运来只是g[j]的迭代器失效，返回下一个迭代器 
				it = g.erase(it);
				break;
			}
		}
	}
	return result;
}

int main() {
	int numChild = 0, numCookie = 0;
	cin >> numChild;
	cin >> numCookie;
	vector<int> children;
	vector<int> cookie; 
	int temp;
	for (int i = 0; i < numChild; i++) {
		cin >> temp;
		children.push_back(temp);
	}
	for (int i = 0; i < numCookie; i++) {
		cin >> temp;
		cookie.push_back(temp);
	}
	cout << findContentChildren(children, cookie) << " children are content!\n";
	return 0;
} 

测试样例1：

测试样例2：