[LeetCode - Medium] Egg Drop With 2 Eggs and N Floors #54

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

Merged

github-actions merged 1 commit into main from jungmyunggi/egg-drop-with-2-eggs-and-n-floors

Feb 16, 2025

Collaborator

jungmyunggi commented Feb 8, 2025

문제

Type	Info
Time Complexity
Space Complexity	O(1)
Algorithm	Triangular Number
Data Structure	x

Constraints

1 <= n <= 1000

Edge Case

x

풀이

숫자를 1부터 N까지 1씩 증가시켜가며 find함수에 넣는다.
x+x-1+x-2...+1을 만족하는 최소의 숫자를 찾는다.

어려웠던 점

이진검색으로 찾으려 시도했었는데 계란 개수가 제한적이여서 실패했다.
삼각수 공식을 처음봐서 이해가 안되어서 오래걸렸다.

알게된 점


          [LeetCode - Medium] Egg Drop With 2 Eggs and N Floors

a24eaaa

jungmyunggi added the JavaScript label

jungmyunggi requested review from BangDori, suhwan2004, asuan99 and Legitgoons

February 8, 2025 01:57

jungmyunggi self-assigned this

github-actions bot enabled auto-merge (squash)

February 16, 2025 01:37

github-actions bot merged commit 5bfd552 into main

2 checks passed

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

Labels