This repository was archived by the owner on Mar 18, 2024. It is now read-only.
[2023-10-02] wooyeol #297 #315
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
Closed
zsmalla
approved these changes
Oct 8, 2023
| # 현재 검사해야하는 선행 스킬의 인덱스를 가지는 스킬과 같다면 정상 | ||
| if alpha == skill[skill_idx]: | ||
| # 다음 선행 스킬을 검사합니다. | ||
| skill_idx += 1 |
There was a problem hiding this comment.
이 포인터가 가르키는 스킬이 결국에는 다른 선행스킬보다 먼저 나와야 한다가 핵심인 풀이네요!
ksumini
approved these changes
Oct 9, 2023
|
|
||
| 데이터의 중복과 갯수가 크게 문제 되지 않기 때문에 완전 탐색으로 단순 구현을 진행하였습니다. | ||
|
|
||
| 완전 탐색 과정 |
There was a problem hiding this comment.
구현 로직 자체가 직관적이어서 빠르게 이해할 수 있었어요! 고생하셨습니다 우열님 👍👍👍
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
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/49993
풀이시간
10:23 ~ 10:39 (16분)
문제 조건
1 <= len(skill) <= 26
1 <= len(skill_trees) <= 20
2 <= 각 skill_trees의 길이 <= 26
시간 복잡도 :
O(20 * 26)
접근법
무슨 알고리즘으로 풀이 할 수 있을까? -> 완전 탐색
데이터의 중복과 갯수가 크게 문제 되지 않기 때문에 완전 탐색으로 단순 구현을 진행하였습니다.
완전 탐색 과정
각각의 스킬트리 과정을 확인합니다.