-
-
Notifications
You must be signed in to change notification settings - Fork 248
[do-heewan] WEEK 2 solutions #1748
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
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.
2주차도 수고하셨습니다 :)
@@ -0,0 +1,4 @@ | |||
class Solution: | |||
def isAnagram(self, s: str, t: str) -> bool: | |||
return sorted(s) == sorted(t) |
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.
간단하고 직관적인 풀이로 하지만 Counter 이용에 대한 아이디어도 한 번은 생각해보시길 바랍니다 :)
@@ -0,0 +1,16 @@ | |||
class Solution: | |||
def productExceptSelf(self, nums: List[int]) -> List[int]: | |||
result = [] |
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.
저는 배열을 여러개 이용해서 풀어서 공간 복잡도가 높아지는 문제점이 있었는데, do-heewan님처럼 이렇게 하나의 배열로 간단하게 해결할 수 있다는 인사이트 얻고 가요. 이번주도 고생 많으셨습니다!
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!