# [2582\. Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/)

:::spoiler Solution

class Solution {
public:
    int passThePillow(int n, int time)
    {
        int rounds = time / (n - 1);
        int steps = time % (n - 1);

        if (rounds % 2 == 0) return steps + 1;
        return n - steps;
    }
};

- 時間複雜度：$O(1)$
- 空間複雜度：$O(1)$
:::