-
Notifications
You must be signed in to change notification settings - Fork 0
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
05 우선순위큐 #2
base: main
Are you sure you want to change the base?
The head ref may contain hidden characters: "05_\uC6B0\uC120\uC21C\uC704\uD050"
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.
2607(P3)
안녕하세요 정민님! 5주차 필수 구현문제 코드리뷰 완료했습니다. 문제의 조건에 맞게 아주 잘 풀어주셔서 따로 수정 제안드릴 부분은 없었습니다. 수고 많으셨습니다.😍
for i in range(len(ow)-1): | ||
oa[ord(ow[i])-ord('A')] += 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.
알파벳 개수를 따로 저장하여 해결해 주셨네요!👍👍
if len(word) == len(ow): | ||
if cnt == 0 or cnt == 2: | ||
result +=1 | ||
|
||
else: | ||
if cnt == 1 and abs(len(word) - len(ow)) == 1: | ||
result += 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.
문제의 핵심을 정확히 파악하셨습니다! 조건 나누기가 아주 깔끔합니다.😮
###인적사항
학번: 2271020
이름: 김정민
과제제출
기존제출: 2607, 2075, 1655, 14253
추가제출: 프로그래머스 디스크 컨트롤러