-
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
[gomgom22] Week4 #829
[gomgom22] Week4 #829
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.
@Yjason-K 님, 4주차도 고생 많으셨습니다!
앞으로도 많은 참여 부탁드려요!
// 너비 우선 탐색을 활용한 풀이 | ||
|
||
const queue: [number, number] [] = [[0, 0]]; // [현재 총합, 깊이] | ||
const visited = new Set<number>(); |
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.
여기서도, 만약 동전에 1원이 있다면 O(m)
만큼의 공간 복잡도가 필요할것 같아요
if (!list1 || !list2) return list1 || list2; | ||
|
||
// 시작점을 위한 더미 헤드 노드 생성 | ||
const start = new ListNode(-101); |
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.
-101에 담고싶으셨던 의미가 있을까요?
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.
큰 의미는 없고 val 제약 조건에 포함되지 않는 수를 지정하고 싶었어요!
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.