算法设计Week6 LeetCode Algorithms Problem #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.

---

题目分析

最普通的想法就是遍历greed factor数组g和cookie大小数组s，当g[i]小于s[j]的时候，就将s[j]发给g[i]，满足了一个孩子的需求。如果要尽量满足更多的孩子，就需要先将数组s从小到大排序，将最小能满足某个孩子需求的饼干发给孩子。这样，题目就得解了。
这种解法的时间复杂度为O(mn)。

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