-
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
[eunhwa99] week 7 #916
base: main
Are you sure you want to change the base?
[eunhwa99] week 7 #916
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.
로직이 깔끔해서 좋았습니다. 이번 주도 수고 많으셨습니다. 다음 주도 화이팅!
} | ||
|
||
private void BFS(char[][] grid, int r, int c, int sizeR, int sizeC) { | ||
Queue<Position> queue = new LinkedList<>(); |
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.
LinkedList를 이용한 bfs 구현도 좋지만, 추가적인 질문으로 Deque를 직접 구현해보라 할 수도 있을 겉 같습니다.
// 행과 열에 0이 있는지 체크할 배열 | ||
Set<Integer> rowZero = new HashSet<>(); | ||
Set<Integer> colZero = new HashSet<>(); |
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.
문제의 Follow up에서 추가적인 메모리 사용이 없이 기존 matrix를 활용하는 방법도 고민해보시면 좋을 것 같습니다.
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.