solves #2582: Pass the Pillow in java

Author: anishLearnsToCode

README.md

@@ -805,7 +805,7 @@
 | 2570 | [Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values)                                                           |                                                                               [![Java](assets/java.png)](src/MergeTwo2DArraysBySummingValues.java)                                                                               |                                                                                                                                   |
 | 2574 | [Left and Right Sum Differences](https://leetcode.com/problems/left-and-right-sum-differences)                                                                         |                                                                                 [![Java](assets/java.png)](src/LeftAndRightSumDifferences.java)                                                                                  |                                                                                                                                   |
 | 2578 | [Split With Minimum Sum](https://leetcode.com/problems/split-with-minimum-sum)                                                                                         |                                                                                     [![Java](assets/java.png)](src/SplitWithMinimumSum.java)                                                                                     |                                                                                                                                   |
-| 2582 | [Pass the Pillow](https://leetcode.com/problems/pass-the-pillow)                                                                                                       |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2582 | [Pass the Pillow](https://leetcode.com/problems/pass-the-pillow)                                                                                                       |                                                                                        [![Java](assets/java.png)](src/PassThePillow.java)                                                                                        |                                                                                                                                   |
 | 2586 | [Count the Number of Vowel Strings in Range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range)                                                 |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2591 | [Distribute Money to Maximum Children](https://leetcode.com/problems/distribute-money-to-maximum-children)                                                             |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2595 | [Number of Even and Odd Bits](https://leetcode.com/problems/number-of-even-and-odd-bits)                                                                               |                                                                                                                                                                                                                                  |                                                                                                                                   |

src/PassThePillow.java

@@ -0,0 +1,15 @@
+// https://leetcode.com/problems/pass-the-pillow
+// T: O(1)
+// S: O(1)
+
+public class PassThePillow {
+    public int passThePillow(int n, int time) {
+        final int direction = (int) Math.ceil((double) time / (n - 1));
+        final int multiplier = direction % 2 == 0 ? -1 : 1;
+        final int steps = time - (direction - 1) * (n - 1);
+        if (multiplier == 1) {
+            return steps + 1;
+        }
+        return n - steps;
+    }
+}