-
-
Notifications
You must be signed in to change notification settings - Fork 195
[영우] Week 1 풀이 제출 #304
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
[영우] Week 1 풀이 제출 #304
Conversation
YeonguChoe
commented
Aug 11, 2024
•
edited
Loading
edited
- contain duplicate
- number of 1 bits
- top k frequent elements
- k th smallest elements in BST
- palindromic substring
커밋 메시지 는 무슨 작업을 했는지 담기면 좋을 것 같습니다. |
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.
For 문안에 while 문을 넣는다고 반드시 O(n^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.
제가 보기에도 O(N^2)같은데, Sam님 의견이 궁금합니다
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.
요것도 시 공간 복잡도 추가부탁드립니다!
원래 제가 리뷰해야할 HajoonYu 님의 2기 참여 여부가 불확실한 것 같아서, 영우님 답안 리뷰어로 참여하겠습니다 |
priority_queue<int, vector<int>, decltype(comparator)> min_heap( | ||
comparator); |
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.
STL을 쓰는 것도 좋지만 한 번 구현해서 써보시면 STL 사용금지인 코딩테스트에서 도움되실 것 같습니다
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.
안녕하세요 영우님 :D
전반적으로 풀이가 깔끔해서 잘 읽히고 좋았습니다
저는 알고리즘 문제 풀이에 욕심이 생겨서 C++에 입문하게 된 지 얼마 안되었는데, 영우님 풀이 보면서 제가 잘 알지 못하던 문법들(decltype, reference operator, lambda expression)도 익힐 수 있었습니다 감사합니다
for (int i = 0; i < s.size(); i++) { | ||
output += find_palindrome1(s, i); | ||
} | ||
for (int i = 0; i < s.size() - 1; i++) { |
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.
안녕하세요 영우님, 풀이 잘 보았습니다 :D
제가 보기엔 두번째 for문이 불필요해보입니다
첫번째 for문 안에서 find_palindrome1과 find_palindrome2를 모두 실행해도 되지 않을까요?
@YeonguChoe 님, 다른 분들 피드백 확인 부탁드리며 모임 전까지 PR 병합 부탁드리겠습니다. |