-
-
Notifications
You must be signed in to change notification settings - Fork 195
[ayosecu] Week 07 Solutions #1469
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
sol = Solution() | ||
for i, (s, e) in enumerate(tc, 1): | ||
r = sol.lengthOfLongestSubstring(s) | ||
print(f"TC {i} is Passed!" if r == e else f"TC {i} is Failed! - Expected: {e}, Result: {r}") |
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.
@ayosecu 님 안녕하세요!
저는 딕셔너리를 활용해서 풀었는데, 이 방식이 조금 더 직관적인 것처럼 느껴졌습니다. 좋은 풀이법 알려주셔서 감사합니다!
sol = Solution() | ||
for i, (m, n, e) in enumerate(tc, 1): | ||
r = sol.uniquePaths(m, n) | ||
print(f"TC {i} is Passed!" if r == e else f"TC {i} is Failed! - Expected: {e}, Result: {r}") |
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.
이전에도 느꼈지만, @ayosecu 님 코드는 항상 간결하고 이해하기 쉬운 것 같습니다. DP 풀이가 참고가 되었습니다!
조금 이르지만 approve 하겠습니다. 이번 주도 고생하셨습니다 😊💪
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!