pass-the-pillow

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

There are <code>n</code> people standing in a line labeled from <code>1</code> to <code>n</code>. The first person in the line is holding a pillow initially. Every second, the person holding the pillow passes it to the next person standing in the line. Once the pillow reaches the end of the line, the direction changes, and people continue passing the pillow in the opposite direction.

<ul>
	<li>For example, once the pillow reaches the <code>nth</code> person they pass it to the <code>n - 1th</code> person, then to the <code>n - 2th</code> person and so on.</li>
</ul>

Given the two positive integers <code>n</code> and <code>time</code>, return the index of the person holding the pillow after <code>time</code> seconds.
&nbsp;
Example 1:

<pre>
Input: n = 4, time = 5
Output: 2
Explanation: People pass the pillow in the following way: 1 -&gt; 2 -&gt; 3 -&gt; 4 -&gt; 3 -&gt; 2.
After five seconds, the 2nd person is holding the pillow.
</pre>

Example 2:

<pre>
Input: n = 3, time = 2
Output: 3
Explanation: People pass the pillow in the following way: 1 -&gt; 2 -&gt; 3.
After two seconds, the 3rd person is holding the pillow.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= n &lt;= 1000</code></li>
	<li><code>1 &lt;= time &lt;= 1000</code></li>
</ul>

&nbsp;
Note: This question is the same as <a href="https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds/description/" target="_blank"> 3178: Find the Child Who Has the Ball After K Seconds.</a>

passThePillow

Pass the Pillow

Find the Student that Will Replace the Chalk

find-the-student-that-will-replace-the-chalk

找到需要补充粉笔的学生编号

Math

Simulation

<code>n</code> 个人站成一排，按从 <code>1</code> 到 <code>n</code> 编号。最初，排在队首的第一个人拿着一个枕头。每秒钟，拿着枕头的人会将枕头传递给队伍中的下一个人。一旦枕头到达队首或队尾，传递方向就会改变，队伍会继续沿相反方向传递枕头。

<ul>
	<li>例如，当枕头到达第 <code>n</code> 个人时，TA 会将枕头传递给第 <code>n - 1</code> 个人，然后传递给第 <code>n - 2</code> 个人，依此类推。</li>
</ul>

给你两个正整数 <code>n</code> 和 <code>time</code> ，返回 <code>time</code> 秒后拿着枕头的人的编号。

&nbsp;

示例 1：

<pre>
输入：n = 4, time = 5
输出：2
解释：队伍中枕头的传递情况为：1 -&gt; 2 -&gt; 3 -&gt; 4 -&gt; 3 -&gt; 2 。
5 秒后，枕头传递到第 2 个人手中。
</pre>

示例 2：

<pre>
输入：n = 3, time = 2
输出：3
解释：队伍中枕头的传递情况为：1 -&gt; 2 -&gt; 3 。
2 秒后，枕头传递到第 3 个人手中。
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= n &lt;= 1000</code></li>
	<li><code>1 &lt;= time &lt;= 1000</code></li>
</ul>

&nbsp;

注意：本题与 <a href="https://leetcode.cn/problems/find-the-child-who-has-the-ball-after-k-seconds/">3178.找出 K 秒后拿着球的孩子</a>&nbsp;一致。