Skip to content
New issue

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

455. 分发饼干 #55

Open
swiftwind0405 opened this issue Jan 17, 2021 · 0 comments
Open

455. 分发饼干 #55

swiftwind0405 opened this issue Jan 17, 2021 · 0 comments
Labels

Comments

@swiftwind0405
Copy link
Owner

swiftwind0405 commented Jan 17, 2021

方法一:贪心算法

解题思想:

代码:

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;
};

复杂度分析:

  • 时间复杂度:
  • 空间复杂度:
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant