[20251101] BOJ / G4 / Elder price robot / 김민진 #1289
Merged
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.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
Elder price robot
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
특정 날을 기준으로 가격이 같거나 저렴했던 날의 차 구하기
없으면
infinity출력🔍 풀이 방법
인덱스를 스택에 넣고 배열을 역순으로 순회하면서 같거나 낮은 가격을 가리키는 인덱스가 나올 때까지
pop()반복문 종료 후 스택에 아무것도 없으면
infinity있으면peek()한 값이ans에 들어감⏳ 회고
스택 어려워~~..