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
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/17089
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N명의 사람이 있고, 세 사람 A, B, C를 고를 때, 세 사람은 모두 친구여야 한다.
A 친구 수 + B 친구 수 + C 친구 수의 최솟값 구하기
🔍 풀이 방법
친구 여부를 저장하는 2차원 배열 friend를 생성하고,
각 사람 별 친구 수를 저장하는 1차원 배열 count를 만들어서
3중 for문을 돌려서 최솟값 찾음
⏳ 회고
습관적 ArrayList 사용했었는데, 2차원 배열에 저장하는게 나은 거 같다.