This repository was archived by the owner on Mar 18, 2024. It is now read-only.
[2023-09-22] wooyeol #241#265
Merged
Merged
Conversation
limstonestone
approved these changes
Sep 22, 2023
Contributor
limstonestone
left a comment
There was a problem hiding this comment.
헉 제가 처음 시도했던 풀이와 완전 똑같아서 깜짝놀랬네요 ㅋㅋㅋ
저도 도저히 시간복잡도를 못줄이겠어서 포기했답니당 ㅠㅠ
수고하셨습니다 우열님!!
zsmalla
approved these changes
Sep 22, 2023
Contributor
zsmalla
left a comment
There was a problem hiding this comment.
참고한 풀이도 깔끔하네요! 우열님 기존 풀이처럼 2중 for문을 활용하면 어떤 예외던 N^2이 나오게 되어 시간초과가 발생하는 것 같습니다. 고생하셨습니다! 내일 다시 풀어보시죠
ksumini
approved these changes
Sep 23, 2023
Contributor
There was a problem hiding this comment.
이 풀이가 가장 깔끔한 정해인 것 같아요! 고생하셨습니다 우열님~~!!👍👍👍
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 subscribe to this conversation on GitHub.
Already have an account?
Sign in.
4 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.
PR Summary
뒤에 있는 큰 수 찾기
https://school.programmers.co.kr/learn/courses/30/lessons/154539
풀이시간
11 :42~48 13:38 ~ 14:10 (풀이 포기)
풀이 참고 : https://maximum-curry30.tistory.com/515
문제 조건
4 <= len(numbers) : N <= 1,000,000
시간 복잡도 :
O(N)
접근법
무슨 알고리즘으로 풀이 할 수 있을까? -> stack