-
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
[Queue] bj2164 카드2 / bj1158 요세푸스 문제 #3
base: main
Are you sure you want to change the base?
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.
고생했습니다!
# 맨 윗쪽 카드 버려라 | ||
queue.popleft() | ||
# 맨 윗쪽 카드 제일 아래로 옮겨라! |
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.
꼼꼼한 주석 좋아요
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.
굿입니다 ♡
end.append(seat.popleft()) | ||
|
||
|
||
print(str(end).replace('[', '<').replace(']', '>')) |
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.
이렇게 간단한 방법이...
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.
최고다 ❤️
📒 문제번호 :
[bj2164] - 카드2
[bj1158] - 요세푸스문제
☑️ PR Point
⏱️시간복잡도
2164 : O(N)
1158 : O(N log N)