class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(),g.end());
sort(s.begin(),s.end());
int ans = 0;
int i = g.size()-1;
int j = s.size()-1;
while(j >= 0){
while(i >= 0 && g[i]> s[j])
i--;
if(i >= 0)
ans++;
j--;
i--;
}
return ans;
}
};
leetcode 455. Assign Cookies
最新推荐文章于 2024-08-25 17:36:33 发布