-
-
Notifications
You must be signed in to change notification settings - Fork 195
[sejineer] Week 05 solutions #1398
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
buy = min(buy, price) | ||
result = max(profit, result) | ||
|
||
return 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.
저는 max, min 메서드를 사용을 하지는 않고 풀었는데 이렇게 푸니 코드가 더 깔끔해보이네요!
s_counter = Counter(s) | ||
strs_dict[frozenset(s_counter.items())].append(s) | ||
|
||
return list(strs_dict.values()) |
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.
역시 파이썬은 제공해주는 메서드가 많아서 자바에 비해 코드가 간단한 것이 좋은 것 같습니다
return True | ||
return False | ||
|
||
return dfs(0) |
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.
저는 재귀로 풀었었는데 dfs로도 풀 수 있네요!
다른 해설을 보았을 때 DP로도 가능하다고 해서, DP 방식도 도전해 보셨으면 좋겠습니다.
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.
DP 풀이도 한 번 도전해 보겠습니다!
1주간 수고하셨습니다! |
리뷰 감사합니다. 다음 주도 화이팅입니다 ㅎㅎ |
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!