-
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
[nakjun12] Week 2 #758
[nakjun12] Week 2 #758
Conversation
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.
2주차 문제풀이 고생 많으셨습니다!
각 구간마다 시간 복잡도를 적어주셔서 다른 문제들 분석에 더 기대가 됩니다.
3주차도 파이팅입니다!
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.
2주차도 고생 하셨습니다, @nakjun12 님!
남은 풀이가 있다면 더 제출해주시고, 3주차 이후로도 계속 활발한 활동 부탁드립니다!
// S.C: O(n) | ||
|
||
function climbStairs(n: number) { | ||
const dp = { 1: 1, 2: 2 }; |
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.
DP와 Object를 사용하셨는데, 이를 좀 더 생각해보면 Arr로 가능하지 않을까요?
function isAnagram(s: string, t: string): boolean { | ||
if (s.length !== t.length) return false; | ||
|
||
// 공간 복잡도: O(k) |
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.
여기서 k로 작성해주셨는데, 문제 조건(lowercase English letters)상 아마 이건 상수가 되지 않을까요?
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.