Skip to content

add Day8#33

Merged
summer2788 merged 1 commit intomainfrom
8일차_Jongeun
Jul 11, 2024

Hidden character warning

The head ref may contain hidden characters: "8\uc77c\ucc28_Jongeun"
Merged

add Day8#33
summer2788 merged 1 commit intomainfrom
8일차_Jongeun

Conversation

@summer2788
Copy link
Contributor

Day-8 / 박종은

문제 번호

  1. 4_MedianofTwoSortedArrays
  2. 104_MaximumDepthofBinaryTree
  3. 226_InvertBinaryTree

(Optional) 공유하고 싶은 내용

Median of Two Sorted Arrays 를 푸느라 고생했다
hard 난이도 중에 가장 어려웠다. easy 2개를 풀 때 hard 하나를 푸는 식으로 시간 배분을 잘해야겠다.
또한 c++ 나누기(/) 연산이 음수를 나눌 때 truncates to zero 한다는 것을 잊고 있었다. 이것때문에 시간 좀 날렸다. 기본에 충실하자

@summer2788 summer2788 self-assigned this Jul 9, 2024
@summer2788 summer2788 linked an issue Jul 9, 2024 that may be closed by this pull request
@github-actions
Copy link

github-actions bot commented Jul 9, 2024

우측에 있는 Projects, Milestone, Development를 확인 후 할당 해주세요~! 🙇

Copy link
Member

@jihostudy jihostudy left a comment

Choose a reason for hiding this comment

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

JS에서는 /가 몫연산을 안해줘서 Math.floor / Math.truc 2개가 따로 존재하는데 역시 언어마다 다르네요.

@summer2788
Copy link
Contributor Author

JS에서는 /가 몫연산을 안해줘서 Math.floor / Math.truc 2개가 따로 존재하는데 역시 언어마다 다르네요.

맞아요 역시 자기의 주언어를 깊게 파는 것이 중요한 것 같습니다.

Copy link
Collaborator

@kinwjdghks kinwjdghks left a comment

Choose a reason for hiding this comment

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

멋져요~~!

@summer2788 summer2788 merged commit a05b068 into main Jul 11, 2024
@summer2788 summer2788 deleted the 8일차_Jongeun branch July 11, 2024 07:05
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

Status: Done

Development

Successfully merging this pull request may close these issues.

[DAILY] 8일차

3 participants