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

[gitsunmin] Week 10 Solutions #540

Merged
merged 3 commits into from
Oct 19, 2024
Merged

[gitsunmin] Week 10 Solutions #540

merged 3 commits into from
Oct 19, 2024

Conversation

gitsunmin
Copy link
Contributor

답안 제출 문제

하나 밖에 못 했네요..

체크 리스트

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

@gitsunmin gitsunmin requested a review from kjb512 October 18, 2024 20:02
@gitsunmin gitsunmin self-assigned this Oct 18, 2024
@gitsunmin gitsunmin requested a review from a team as a code owner October 18, 2024 20:02
@github-actions github-actions bot added the ts label Oct 18, 2024
Copy link
Contributor

@HC-kang HC-kang left a comment

Choose a reason for hiding this comment

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

@gitsunmin 님 고생하셨습니다!
했다는게 중요하죠! 하나밖에 못하신 게 아니고 하나를 해내신거라고 봅니다!! ㅎㅎ
앞으로도 화이팅!!

/**
* https://leetcode.com/problems/invert-binary-tree/
* time complexity : O(n)
* space complexity : O(log N)
Copy link
Contributor

Choose a reason for hiding this comment

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

dfs를 사용하셨고 T.C. 가 O(n)이라면, 최악의 경우 S.C.또한 O(n)이 되지 않을까요?

@gitsunmin gitsunmin merged commit fcd0185 into DaleStudy:main Oct 19, 2024
1 check 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.

2 participants