안효원 / 4주차#33
Open
NotHyoone wants to merge 51 commits into
Open
Conversation
# Conflicts: # .idea/misc.xml # .idea/vcs.xml # HWpc/week1_1.java # HWpc/week1_3.java # HWpc/week2_1.java # HWpc/week2_2.java
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.
전국대회선발고사 / 하
ArrayList 를 사용해서 attendance 가 true인 값을 list에 추가하고 오름차순으로 정렬 후, 1,2,3 등을 차례로 구해 결과를 반환한다.
동영상 재생기 / 중
문자열로 주어진 시간들을 모두 정수형으로 변환해서 prev, next, opning_skip 을 구현한 다음 형식에 맞게 문자열로 변환해 결과를 반환한다.
요세푸스 / 상
처음에는 Queue를 사용해서 풀어봤는데, 메모리와 시간을 많이 잡아먹어서 list를 사용하고 index를 수식으로 계산해 조금 더 효율적인 코드를 작성할 수 있었다.