一刷1823

diguage · diguage · commit cbe316b6a9b4 · 2024-09-19T15:52:41.000+08:00
diff --git a/README.adoc b/README.adoc
@@ -12787,12 +12787,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|Easy
 //|
 
-//|{counter:codes}
-//|{leetcode_base_url}/find-the-winner-of-the-circular-game/[1823. Find the Winner of the Circular Game^]
-//|{source_base_url}/_1823_FindTheWinnerOfTheCircularGame.java[Java]
-//|{doc_base_url}/1823-find-the-winner-of-the-circular-game.adoc[题解]
-//|Medium
-//|
+|{counter:codes}
+|{leetcode_base_url}/find-the-winner-of-the-circular-game/[1823. Find the Winner of the Circular Game^]
+|{source_base_url}/_1823_FindTheWinnerOfTheCircularGame.java[Java]
+|{doc_base_url}/1823-find-the-winner-of-the-circular-game.adoc[题解]
+|Medium
+|
 
 //|{counter:codes}
 //|{leetcode_base_url}/minimum-sideway-jumps/[1824. Minimum Sideway Jumps^]
diff --git a/docs/1823-find-the-winner-of-the-circular-game.adoc b/docs/1823-find-the-winner-of-the-circular-game.adoc
@@ -18,8 +18,10 @@ The rules of the game are as follows:
 Given the number of friends, `n`, and an integer `k`, return _the winner of the game_.
 
  
-<strong class="example">Example 1:*
-<img alt="" src="https://assets.leetcode.com/uploads/2021/03/25/ic234-q2-ex11.png" style="width: 500px; height: 345px;" />
+*Example 1:*
+
+image::images/1823-00.png[{image_attr}]
+
 [subs="verbatim,quotes"]
 ----
 *Input:* n = 5, k = 2
@@ -50,7 +52,7 @@ Given the number of friends, `n`, and an integer `k`, return _the winner of the
 *Constraints:*
 
 
-* `1 <= k <= n <= 500`
+* `1 \<= k \<= n \<= 500`
 
 
  
@@ -62,6 +64,8 @@ Could you solve this problem in linear time with constant space?
 
 == 思路分析
 
+image::images/1823-01.png[{image_attr}]
+
 
 [[src-1823]]
 [tabs]
@@ -88,4 +92,7 @@ include::{sourcedir}/_1823_FindTheWinnerOfTheCircularGame.java[tag=answer]
 
 == 参考资料
 
+. https://leetcode.cn/problems/find-the-winner-of-the-circular-game/solutions/1463524/zhao-chu-you-xi-de-huo-sheng-zhe-by-leet-w2jd/?envType=study-plan-v2&envId=selected-coding-interview[1823. 找出游戏的获胜者 - 官方题解^]
+. https://leetcode.cn/problems/find-the-winner-of-the-circular-game/solutions/2362052/1823-zhao-chu-you-xi-de-huo-sheng-zhe-yu-tkst/?envType=study-plan-v2&envId=selected-coding-interview[1823. 找出游戏的获胜者 - 约瑟夫环，清晰图解^]
+
 
diff --git a/docs/images/1823-00.png b/docs/images/1823-00.png
diff --git a/docs/images/1823-01.png b/docs/images/1823-01.png
diff --git a/docs/index.adoc b/docs/index.adoc
@@ -3720,7 +3720,7 @@ include::1650-lowest-common-ancestor-of-a-binary-tree-iii.adoc[leveloffset=+1]
 
 // include::1822-sign-of-the-product-of-an-array.adoc[leveloffset=+1]
 
-// include::1823-find-the-winner-of-the-circular-game.adoc[leveloffset=+1]
+include::1823-find-the-winner-of-the-circular-game.adoc[leveloffset=+1]
 
 // include::1824-minimum-sideway-jumps.adoc[leveloffset=+1]
 
diff --git a/logbook/202406.adoc b/logbook/202406.adoc
@@ -727,6 +727,11 @@
 |{doc_base_url}/0136-single-number.adoc[题解]
 |✅ 位运算，异或
 
+|{counter:codes}
+|{leetcode_base_url}/find-the-winner-of-the-circular-game/[1823. Find the Winner of the Circular Game^]
+|{doc_base_url}/1823-find-the-winner-of-the-circular-game.adoc[题解]
+|❌ 约瑟夫环，使用队列出队入队来模拟计数，出队表示删除。妙！
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。
diff --git a/src/main/java/com/diguage/algo/leetcode/_1823_FindTheWinnerOfTheCircularGame.java b/src/main/java/com/diguage/algo/leetcode/_1823_FindTheWinnerOfTheCircularGame.java
@@ -0,0 +1,27 @@
+package com.diguage.algo.leetcode;
+
+import java.util.ArrayDeque;
+import java.util.Queue;
+
+public class _1823_FindTheWinnerOfTheCircularGame {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-19 15:24:45
+   */
+  public int findTheWinner(int n, int k) {
+    Queue<Integer> queue = new ArrayDeque<>(n);
+    for (int i = 1;i<=n;i++) {
+      queue.offer(i);
+    }
+    while(queue.size()>1) {
+      for (int i= 1;i<k;i++) {
+        queue.offer(queue.poll());
+      }
+      queue.poll();
+    }
+    return queue.poll();
+  }
+  // end::answer[]
+}
