day22打卡

455. 分发饼干

class Solution {
public:
int findContentChildren(vector& g, vector& s) {
sort(g.begin(), g.end());
sort(s.begin(), s.end());
int count = 0;
int i = 0;
int j = 0;
for(;i < g.size() && j < s.size()