Leetcode|简单|455. 分发饼干

1 贪心算法

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