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
2 participants
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://www.acmicpc.net/problem/17298
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
수열이 주어졌을 때 어떤 위치의 수보다 오른쪽에 있으면서 그 수보다 큰 수중 가장 왼쪽에 있는 수를 오큰수라고 합니다.
각 수의 오큰수를 모두 출력하는 문제입니다.
🔍 풀이 방법
스택을 이용하여 풀었습니다.
큰 값을 찾을 때 까지 pop을 하고
스택이 빈 경우에는 -1을 입력했습니다.
⏳ 회고
얼마전에 스택, 자료구조를 이용한 문제를 풀었던것 같은데 그 기억이 도움이 되었습니다.