class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(), g.end());
sort(s.begin(), s.end());
int n = g.size(), m = s.size();
int res = 0;
for(int i = 0, j = 0; i < n && j < m; ++i, ++j){
while(j < m && g[i] > s[j]){
++j;
}
if(j < m){
++res;
}
}
return res;
}
};
LeetCode 455. 分发饼干
最新推荐文章于 2024-10-06 20:10:02 发布