조이썬(이영수) - 3주차#8
Open
youngsu5582 wants to merge 2 commits into
Open
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
1 participant
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.
4889 - 안정적인 문자열
Deque 를 사용해서
일반적인 Stack 으로 카운트 후
Queue 처럼 2개씩 확인해서 계산
6236 - 용돈 관리
처음에 좀 긴가민가 했는데
이거 절대 구할 수 없다 싶으면 이분탐색으로 접근하는게 맞는듯
횟수를 넘기면 더 크게, 횟수를 넘기지 않으면 더 작게 반복
1245 - 농장 관리
솔직히 머리가 안돌아서 못 풀었슴다.
다음에 트라이 해볼 예정
일반적인 DFS 인데 피크를 감지하는 부분에 대해 생각해야 함
20167 - 호석 애벌레
다시 보니 부분 성공 이네욤.
초과를 하면 해당 부분부터 다음값 까지 확인해서 최대값인지 검증하는 로직 으로 짰는데
DP 적인 접근으로 메모리제이션을 쓴다면 더 효율적일거 같습니다. ( 될지 안될지 몰루 )