-
Notifications
You must be signed in to change notification settings - Fork 120
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
[haklee] week 12 #568
[haklee] week 12 #568
Conversation
def merge(self, intervals: List[List[int]]) -> List[List[int]]: | ||
max_v = int(1e4 + 2) | ||
flags = [False] * max_v | ||
억까 = [] |
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.
ㅋㅌㅋㅋㅋㅋ
def merge(self, intervals: List[List[int]]) -> List[List[int]]: | ||
max_v = int(1e4 + 2) | ||
flags = [False] * max_v | ||
억까 = [] |
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.
억까
처리가 잘 된것 같아요 :D
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.
이번주도 수고많으셨습니다!
i += 1 | ||
cur_head = cur_head.next | ||
|
||
cur_head.next = None if cur_head.next is None else cur_head.next.next |
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.
모든 노드를 순회하지 않는 방법을 선택하셨네요. 좋은 방법인거 같아요!
아이디어: | ||
- 트리 구조를 dict로 만들어버리자. | ||
- Node = None | {v: int, l: Node, r: Node} | ||
- 이 dict를 python에 있는 json 패키지를 써서 string으로 바꾸고, string에서 불러온다. |
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.
오.. 정말 간단하게 생각해서 풀수도 있는 문제군요..?!👍
자료구조에서 풀려고 생각만 했지 string으로 풀 생각은 못했네요😅
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.