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.

解析：

题目本质是比较两个数组中有几个数字是一样的，采用了贪心算法的解题思路，先对这两个数组进行排序（插入排序），然后对这两个数组从小到大进行比较，看是否相同。

代码：

class Solution {
public:
    void insert_sort(vector<int> &n)
    {
        int size = n.size();
        for(int i = 1;i<size;i++)
        {
            int first_unsort = n[i];
            int j = i-1;
            while(j>=0 && n[j] > first_unsort)
            {
                n[j+1] = n[j];
                j--;
            }
            n[j+1]=first_unsort;
        }
    }
    int findContentChildren(vector<int>& g, vector<int>& s) {
        insert_sort(g);
        insert_sort(s);
        int result = 0;
        int size1 = 0;
        int size2= 0;
        while(size1<g.size() && size2<s.size())
        {
            if(g[size1]<=s[size2])
            {
                size1++;
                size2++;
            }
           
            else
            {
                size2++;
            }
        }
        
        return size1;
        
    }
};