[20250907] PGM / LV2 / 다리를 지나는 트럭 / 김수연 #839
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.
🧷 문제 링크
https://school.programmers.co.kr/learn/courses/30/lessons/42583?language=java
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
트럭 여러대가 다리로 강을 건너려고 할 때, 모든 트럭이 다리를 건너려면 최소 몇 초가 걸리는지 구하기
단, 다리에 최대로 올라갈 수 있는 대 수와, 무게가 주어짐
🔍 풀이 방법
Queue사용
현재 다리에 있는 트럭 무게와 다음에 올라갈 트럭 무게를 while문 돌리면서 계속 확인해서 queue에 넣어줌
⏳ 회고
단순 구현이다