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.

思路

先把两个数组由小到大排序。然后用选定s的一个数，去搜索g的数。直到找到s[i]比g[j+1]小但>=g[j]，g[j]就是要分配的人。同时删除g[i].继续循环

代码

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


    void Qsort(vector<int>& A, int low, int high) {
        if (low >= high)
        {
            return;
        }
        int first = low;
        int last = high;
        int key = A[first];/*用字表的第一个记录作为枢轴*/

        while (first < last)
        {
            while (first < last && A[last] >= key)
            {
                --last;
            }

            A[first] = A[last];/*将比第一个小的移到低端*/

            while (first < last && A[first] <= key)
            {
                ++first;
            }

            A[last] = A[first];
            /*将比第一个大的移到高端*/
        }
        A[first] = key;/*枢轴记录到位*/
        Qsort(A, low, first - 1);
        Qsort(A, first + 1, high);
    }
};