-
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
[mallayon] Week 6 #899
[mallayon] Week 6 #899
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.
@mmyeon 님~ 항상 좋은 풀이 남겨주셔서 감사합니다!!
덕분에 리뷰하면서 정말 많이 배우고 있어요.
6주차도 고생 많으셨고, 15주차까지 열심히 응원하겠습니다~
@@ -0,0 +1,33 @@ | |||
/** | |||
*@link https://leetcode.com/problems/container-with-most-water/description/ |
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.
감사합니다 👍 리뷰할 때 문제 보기 너무 좋아요!
valid-parentheses/mmyeon.ts
Outdated
* | ||
* 공간복잡도 : O(k) | ||
* - pairs 객체 고정된 크기로 저장 O(1) | ||
* - stack에 열린 괄호 개수만큼 담기니까 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.
전체 길이 n
중, 열린 괄호의 수를 k(<n)
로 표현하신거죠?
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에 대한 설명이 빠졌네요! 주석 좀 더 자세하게 변경했습니다 ! 감사합니다 😄
spiral-matrix/mmyeon.ts
Outdated
* - m x n 행렬의 모든 숫자 방문하니까 O(m x n) | ||
* | ||
* 공간복잡도 : O(n) | ||
* - 숫자 길이만큼 배열에 담음 * |
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.
숫자 길이가 혹시 행렬의 모든 숫자 말씀이실까요?
그렇다면 시간복잡도와 같이 O(m x n)
이 되지 않을까 싶어서요!
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.
네 맞습니다!
생각해보니 숫자 길이 n만큼만 반복하니까 O(n)
으로 작성하는게 더 이해하기 좋을 것 같아요!
복잡도 모두 O(n)
으로 수정했습니다~
꼼꼼히 봐주셔서 감사합니다 !!
}; | ||
|
||
while (top <= bottom && left <= right) { | ||
moveRight(); |
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.
정말 깔끔하네요 👍
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.