Repository navigation
Conversation
Contributor
|
🤖 AI 리뷰(알고리즘 패턴, 시간/공간 복잡도, 학습 현황) 결과는 Checks 탭에서 볼 수 있어요. |
201411108
reviewed
Nov 21, 2026
Comment on lines
+17
to
+21
| for c in t: | ||
| count[c] = count.get(c, 0) - 1 | ||
|
|
||
| if count[c] < 0: | ||
| return False |
Contributor
There was a problem hiding this comment.
👍 c에서 양수로 만들고, t에서 뺄셈으로 0 여부를 체크하는 구문을 배워갑니다!
| # https://leetcode.com/problems/product-of-array-except-self/description/ | ||
| 시간 복잡도 : O(n) | ||
| 공간 복잡도 : O(1) (정답 배열 제외) |
Contributor
There was a problem hiding this comment.
❓ 다른 분도 비슷한 풀이를 제출해주셔서 궁금한 부분인데, 정답 배열을 제외하고 공간 복잡도가 O(1)로 계산되는 부분이 궁금합니다.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
답안 제출 문제
작성자 체크 리스트
In Review로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!