-
Notifications
You must be signed in to change notification settings - Fork 126
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
[HodaeSsi] Week 02 #762
[HodaeSsi] Week 02 #762
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주차 수고 많으셨습니다 화이팅
answerSet = set() | ||
nums.sort() |
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.
정렬은 강력한 조건이기 때문에 set을 사용하지 않고 인덱스를 사용해서 중복을 제거하는 방법도 이용해볼 수 있습니다
leftIdx = leftIdx + 1 | ||
rightIdx = rightIdx - 1 | ||
|
||
return list(answerSet) |
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.
그러면 여기서 set을 list로 돌리지 않아도 될 것 같습니다
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 = [] | ||
dp.append(0) | ||
dp.append(1) | ||
dp.append(2) |
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 = [] | |
dp.append(0) | |
dp.append(1) | |
dp.append(2) | |
dp = [0, 1, 2] |
이게 더 깔끔할 것 같아서 제안드립니다
for i in range(3, n + 1): | ||
dp.append(dp[i - 1] + dp[i - 2]) | ||
|
||
return dp[n] |
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 dp[n] | |
return dp[-1] |
파이썬에서는 이렇게 하면 배열 마지막 원소라는 점이 명확해서 가독성에 도움이 됩니다
continue | ||
if s[idx] == '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.
이렇게 if-elif-else 구문이 많으면 논리적으로 분리되는 지점에 나눠주시면 가독성에 도움이 됩니다
tLetterDict = {} | ||
|
||
for letter in s: | ||
sLetterDict[letter] = sLetterDict.get(letter, 0) + 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.
기본 메서드를 활용한 깔끔한 라인이 좋습니다
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.