455. Assign Cookies

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.

思路
一个简单的贪心分配问题，首要的是先满足需求饼干少的小孩，对饼干和小孩需求都从小到大排序，然后依次遍历。
code1：
直接两重for循环，时间复杂度较高，做了很多次无用的计算。

 	class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(g.begin(),g.end());
        sort(s.begin(),s.end());
        vector<int>a(s.size(),0);
        int count=0;
        for(int i=0;i<g.size();i++){
            for(int j=0;j<s.size();j++){
                if(a[j]==1){
                    continue;
                }else if(s[j]>=g[i]){
                    count++;
                    a[j]=1;
                    j=s.size()-1;
                }
            }
        }
        return count;
    }
};

思路二：在一的基础上，由于是已经排好序的，所以，应该设置一个标记点，因为小孩的需求序列是从小到大的，那么在标记点之前的，不管有没有分配掉，饼干的大小都是不可能能够满足当前小孩的需求的。所以从标记点开始往后遍历饼干即可。

	class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(g.begin(),g.end());
        sort(s.begin(),s.end());
        int count=0;
        int index=-1;
        for(int i=0;i<g.size();i++){
            for(int j=index+1;j<s.size();j++){
                if(s[j]>=g[i]){
                    count++;
                    index=j;
                    break;
                }
            }
        }
        return count;
    }
};