update 1823

fishercoder1534 · fishercoder1534 · commit 7506736764d2 · 2024-07-07T17:43:47.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/secondthousand/_1823.java b/src/main/java/com/fishercoder/solutions/secondthousand/_1823.java
@@ -24,8 +24,9 @@ public int findTheWinner(int n, int k) {
 
     public static class Solution2 {
         /**
-         * My completely original solution: use a double linked list to keep moving people from
-         * the tail of the queue to the head of the queue until there's only one person in the queue who is the winner.
+         * My completely original solution: use a double linked list to keep moving (k - 1) people from
+         * the tail of the queue to the head of the queue, and then remove the kth person,
+         * until there's only one person in the queue who is the winner.
          */
         public int findTheWinner(int n, int k) {
             Deque<Integer> doublyLinkedList = new LinkedList<>();
