-
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
[bky373] Week 3 Solutions #75
Conversation
climbing-stairs/bky373.java
Outdated
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.
배열에 값들을 담아줄 수도 있지만, 현재 값을 구하기 위해서는 전과 전의 전 값만 필요한 것을 고려하면 공간복잡도를 상수항으로 만들 수도 있을 것 같습니다.
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.
좋은 피드백이네요 😃
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.
와.. 이런 접근이 가능했군요! 문제 새로 풀어두었습니다 감사합니다!
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.
져도 처음에는 list에 쌓았는데 피드백 받아서 고쳤습니다ㅎㅎ
climbing-stairs/bky373.java
Outdated
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.
좋은 피드백이네요 😃
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.
수고하셨습니다!
Problems
104. Maximum Depth of Binary Tree
100. Same Tree
572. Subtree of Another Tree
70. Climbing Stairs
252. Meeting Rooms