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.

Sign up for GitHub

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

Jump to bottom

Leetcode 1760. Minimum Limit of Balls in a Bag #260

Open

Woodyiiiiiii opened this issue May 30, 2023 · 0 comments

Owner

Woodyiiiiiii commented May 30, 2023

1760. Minimum Limit of Balls in a Bag

1760. Minimum Limit of Balls in a Bag

记一次惨痛教训。

这道题我一开始的思路就是二分，但是看到题目条件中nums[i]最大是10^9，我就下意识以为二分后10^5，再加上数组长度会超时TLE，所以就放弃了二分的做法。

显然我很~~SB和愚蠢~~，10^9对2取对数后结果是29.多，可以逆向思维想到2的多少次方是10^9。太想当然了...

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment