[23-01-30] doha #22
Merged
[23-01-30] doha #22
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Su
2C3E
ggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
PR Summary
뒤에 있는 큰 수 찾기
생각보다 오래 걸렸어요, stack을 생각해내는데 오래 걸린듯
처음에 이중 for문으로 하다가 정확도 78점 나와서 아 이거 딱봐도 stack 아니면 heap 문제겠구나 파악했습니다
하지만 stack을 어떻게 써야 효율적일까 고민하다가 시간을 많이 썼어요(아직 미숙하기도 하고)
index의 값을 유지하면 되나? 싶어서 적용한 방법이 잘 되어서 다행이었습니다.
자세한 설명은 주석에 달아놨으니 같이 보면서 설명해드릴게요
마법의 엘리베이터
이거는 규칙을 찾는게 좀 힘들었지만, 손으로 슥슥 경우의수 생각하면서 해보니 금방 풀었습니다.
주의해야할게, 단순히 5이상이면 자릿수 올려서 계산하는게 아니라, 5일때 앞자리가 어떤 숫자인지에 따라 또 다른 경우가 있어서
이부분 주의해서 풀었더니 다 통과했습니다.
ISSUE NUMBER