-
-
Notifications
You must be signed in to change notification settings - Fork 195
[i-mprovising] Week 07 solutions #1459
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.
이번 주 알고리즘 풀이들 흥미롭게 읽어봐서 좋았습니다! 고생하셨습니다 😃
다음 주도 화이팅입니다 😎
""" | ||
def lengthOfLongestSubstring(self, s: str) -> int: | ||
max_len = 0 | ||
q = deque() |
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.
deque
를 이용하는 방식 흥미롭게 잘 보았습니다!
dx = [-1, 1, 0, 0] | ||
dy = [0, 0, -1, 1] | ||
for k in range(4): | ||
nx, ny = x + dx[k], y + dy[k] |
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.
dx
dy
가 무엇인지 궁금하였는데, 거리 이동을 위한 배열이네요! 재밌게 보았습니다 :)
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!