-
Notifications
You must be signed in to change notification settings - Fork 126
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[KwonNayeon] Week 4 #806
[KwonNayeon] Week 4 #806
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
정성들여 적으신 풀이 덕분에, 코드를 이해하기가 수월해서 좋았습니다 :)
+) 영어 표현도 익혀갑니다 🙇 (닫힌 범위를 나타낼 때 inclusive라는 표현)
Time Complexity: O(N * 3^L) | ||
- N은 board의 모든 cell (m * n) | ||
- L은 word의 길이 | ||
- 각 cell에서 시작하여 word의 각 글자마다 세방향으로 탐색 (이미 방문한 방향 제외) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
저는 O(N * 4^L)이라고 생각했었는데, 적어주신 설명을 보니 O(N * 3^L)이 더 타당해 보이네요! 👍👍
Time Complexity: O(nlogn) | ||
- 정렬에 nlogn, 순회에 n이 필요하므로 전체적으로 O(nlogn) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
정렬을 사용하지 않고 O(n)에 푸는 풀이도 가능 할 것 같은데, 시간 되실 때 한번 생각해보셔도 좋을 것 같습니당 😄
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@forest000014 님 자세한 리뷰 감사합니다 😊 리뷰해주신 것 참고해서 다시 풀어봐야겠어요! 이번 주도 고생하셨습니다!
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
좋은 피드백이 오간 pr이네요 ㅎㅎ 고생많으셨습니다!
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.