-
-
Notifications
You must be signed in to change notification settings - Fork 248
[youngduck] WEEK 03 solutions #1781
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
Conversation
// replace, replaceAll 시간복잡도: O(n) | ||
const result = bin.replaceAll('0', '').length; | ||
|
||
// 시간복잡도: O(n), 공간복잡도: O(1) |
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.
오 replace 생각하지 못했는데 좋네용! 그리구 이진이라서 O(logn)이나.. 심지어 O(1) 으로도 풀이가 가능하더라구요. 다른 풀이들도 도전해보시면 좋을 것 같습니다.
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-palindrome/youngduck.js
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.
3주차 문제 풀이 고생하셨습니다!
코멘트 남겨드린 대로 bit operation 풀이만 한번 더 해보시면 너무 좋을것 같아요.
정규식 쓰신 부분 너무 멋지네요.
4주차 문제 풀이도 잘 부탁드립니다!
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!