[20251122] BOJ / P5 / 최솟값 찾기 / 김민진 #1478
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.
🧷 문제 링크
최솟값 찾기
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
길이
N이 숫자 배열이 주어졌을 때i ~ i + L범위의 부분 수열에서 최솟값 나열하기🔍 풀이 방법
인덱스와 값을 저장하는
Node객체를 저장하는 덱을 선언덱에 있는 숫자 중에서 넣으려는 현 숫자보다 큰 수들은 있어봐야 아무 의미 없으니까 전부 제거
범위를 벗어나는 수도 제거
범위를 벗어나는 수는 무조건 최솟값이기 때문에 왼쪽에 있음
제거 후 왼쪽에 있는 값 출력
마지막 숫자까지 진행하면 됨
⏳ 회고
알고리즘의 세계는 무궁무진하구나~..