-
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
[jaejeong1] week 5 #454
[jaejeong1] week 5 #454
Conversation
안녕하세요~
https://github.com/DaleStudy/leetcode-study/actions/runs/10842861783 |
네 추가 했습니다! |
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.
시공간 복잡도도 주석에 추가해주시면 좋을 것 같습니다 <- 아 주석 안에 있는 걸 놓쳤네요
주차가 끝난 시점이라 작업 올려주신 거 승인하였는데 코멘트 확인 부탁드립니다!
private String createAnagramData(String str) { | ||
Map<Character, Integer> map = new HashMap<>(); | ||
|
||
for (int i=0; i<str.length(); 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.
여기서 str.length()
만큼 순회가 이루어지니, 시간 복잡도가 O(N)
보다 더 큰 값이어야 할 것 같습니다! (N: strs.length 라는 가정 하에)
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.
@bky373
피드백 감사합니다! N이 아닌 N^2 이 되어야 맞겠군요 :) 수정했습니다!
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.