We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
解题思想:
代码:
var findContentChildren = function(g, s) { const sortFunc = (a, b) => a - b; g.sort(sortFunc); s.sort(sortFunc); let i = 0; s.forEach(n => { if ( n >= g[i]) { i++; } }); return i; };
复杂度分析:
The text was updated successfully, but these errors were encountered:
No branches or pull requests
方法一:贪心算法
解题思想:
代码:
复杂度分析:
The text was updated successfully, but these errors were encountered: