while friends[fp % n]: # The friend is not there. fp += 1 # Point to the next one.

| 0622 | [设计循环队列](https://leetcode.cn/problems/design-circular-queue/) | [Python](https://github.com/itcharge/LeetCode-Py/blob/main/Solutions/0622.%20%E8 ...