-
-
Notifications
You must be signed in to change notification settings - Fork 195
[Leo] 14th Week solutions #212
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
if not matrix: | ||
return [] |
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.
1 <= m, n <= 200
nit: 문제에 위와 같은 제한사항이 주어졌으니 이러한 검사는 불필한 것 같습니당~
res.extend(matrix.pop(0)) | ||
matrix = [*zip(*matrix)][::-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.
@@ -0,0 +1,6 @@ | |||
class Solution: | |||
def getSum(self, a: int, b: int) -> int: | |||
return add(a,b) |
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.
넵..ㅋㅋ 조금 사기성이 짙은 솔루션이지만요 🤣
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.
앗.. 다시 찾아보니 이거 빌트인이 아니네요! 리트코드가 어지간한 모듈을 이미 임포트 해놔서 제가 아무생각없이 써버렸네요 ㅠㅠㅋㅋ
No description provided.