Skip to content

Conversation

@Grit03
Copy link
Collaborator

@Grit03 Grit03 commented Jul 9, 2022

No description provided.

Copy link
Collaborator

@donghoony donghoony left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

고생하셨습니다! 개선사항을 리뷰드려요

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

문제에 적절한 자료구조 선정 💯

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

벨트에서 0의 개수를 세는 deque.count()O(N)으로 꽤 큰 부하를 가집니다. 좀 더 효율적으로 내구도가 0인 칸의 개수를 세는 방법이 있을까요?

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

앗 몰랐던 내용이네요!! 고려해서 생각해보겠습니다 :) 감사합니다 👍

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

list.remove()O(N)으로 문제풀이에서 권장되는 방법은 아닙니다! 가장 먼저 벨트에 올라간 로봇은 항상 맨 뒤에 위치합니다. 이 관찰로 접근하면 조금 더 효율적으로 문제를 해결할 수 있어요.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants