Easy

Assign CookiesC++

Full explanation · Time O(nlogn) · Space O(1)

// Time:  O(nlogn)
// Space: O(1)

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(g.begin(), g.end());
        sort(s.begin(), s.end());

        int result = 0;
        for (int i = 0, j = 0; j < s.size(); ++j) {
            if (i == g.size()) {
                break;
            }
            if (s[j] >= g[i]) {
                ++i;
                ++result;
            }
        }
        return result;
    }
};