Leetcode贪心 分发饼干

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 g[i], which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s[j]. If s[j] >= g[i], 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.

思路
这是一道基础的贪心算法题（然而我…）
首先需要将两个数组进行排序，接着对数组s进行遍历，倘若数组中s当前首个未分发的饼干大于等于当前数组g首个未分到饼干的孩子，那么就可以分发饼干了。倘若是小于关系，那么扔掉当前数组g中首个未分发的饼干，因为肯定用不上了。

代码

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