class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(),g.end());
sort(s.begin(),s.end());
int p1=0;
int p2=0;
int res=0;
while(p1<g.size()&&p2<s.size()) {
if(g[p1]<=s[p2]) {
res++;
p1++;
p2++;
}
else {
p2++;
}
}
return res;
}
};
Leetcode455(力扣455):分发饼干
最新推荐文章于 2023-04-09 21:33:42 发布