Skip to content
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

Merged
merged 1 commit into from
Nov 3, 2024
Merged

[haklee] week 12 #568

merged 1 commit into from
Nov 3, 2024

Conversation

haklee
Copy link
Contributor

@haklee haklee commented Oct 28, 2024

답안 제출 문제

체크 리스트

  • PR을 프로젝트에 추가하고 Week를 현재 주차로 설정해주세요.
  • 바로 앞에 PR을 열어주신 분을 코드 검토자로 지정해주세요.
  • 문제를 모두 푸시면 프로젝트에서 Status를 In Review로 설정해주세요.
  • 코드 검토자 1분 이상으로부터 승인을 받으셨다면 PR을 병합해주세요.

@haklee haklee requested a review from a team as a code owner October 28, 2024 14:14
@github-actions github-actions bot added the py label Oct 28, 2024
@haklee haklee requested a review from Sunjae95 October 28, 2024 14:14
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
max_v = int(1e4 + 2)
flags = [False] * max_v
억까 = []
Copy link
Contributor

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
억까 = []
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

억까 처리가 잘 된것 같아요 :D

Copy link
Contributor

@Sunjae95 Sunjae95 left a 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
Copy link
Contributor

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에서 불러온다.
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

오.. 정말 간단하게 생각해서 풀수도 있는 문제군요..?!👍
자료구조에서 풀려고 생각만 했지 string으로 풀 생각은 못했네요😅

@haklee haklee merged commit 37d9e04 into DaleStudy:main Nov 3, 2024
3 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
No open projects
Status: Completed
Development

Successfully merging this pull request may close these issues.

4 participants