-
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
[나리] WEEK 03 Solutions #386
Conversation
* **/ | ||
|
||
var twoSum = function (nums, target) { | ||
let map = new Map(); |
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.
프론트엔드 엔지니어로 일 할 땐 Map
이 있다는 것만 알고 한 번도 써본 적이 없었는데 나리님께서 풀이에 사용하셨길래 좀 찾아보았습니다
(key, value) 쌍을 담는 컨테이너 역할로 사용하기엔 Map
이 더 편한 구석이 많다는 것 알아갑니다 :D
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.
안녕하세요 나리님, 나누기 연산자를 사용하면 안 된다고 문제에 적혀 있습니다.
You must write an algorithm that runs in O(n) time and without using the division operation.
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.
앗 해당 문장을 못봣네요 ㅜㅜ 😨
draft에서 PR로 전환하셨길래 이번 차수는 4문제까지만 푸시는 걸로 이해했습니다 :) |
너무 리뷰 시작점이 늦어지는 것 같아 리뷰는 4번까지만 받아도 괜찮으니 미리 review로 돌려놨습니다! 감사합니다~ |
WEEK 03 Problems