一刷816

Author: diguage

README.adoc

@@ -5737,12 +5737,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 |Hard
 |
 
-//|{counter:codes}
-//|{leetcode_base_url}/ambiguous-coordinates/[816. Ambiguous Coordinates^]
-//|{source_base_url}/_0816_AmbiguousCoordinates.java[Java]
-//|{doc_base_url}/0816-ambiguous-coordinates.adoc[题解]
-//|Medium
-//|
+|{counter:codes}
+|{leetcode_base_url}/ambiguous-coordinates/[816. Ambiguous Coordinates^]
+|{source_base_url}/_0816_AmbiguousCoordinates.java[Java]
+|{doc_base_url}/0816-ambiguous-coordinates.adoc[题解]
+|Medium
+|
 
 |{counter:codes}
 |{leetcode_base_url}/linked-list-components/[817. Linked List Components^]

docs/0816-ambiguous-coordinates.adoc

@@ -1,62 +1,80 @@
 [#0816-ambiguous-coordinates]
-= 816. Ambiguous Coordinates
+= 816. 模糊坐标
 
-{leetcode}/problems/ambiguous-coordinates/[LeetCode - Ambiguous Coordinates^]
+https://leetcode.cn/problems/ambiguous-coordinates/[LeetCode - 816. 模糊坐标^]
 
-We had some 2-dimensional coordinates, like `"(1, 3)"` or `"(2, 0.5)"`.  Then, we removed all commas, decimal points, and spaces, and ended up with the string `S`.  Return a list of strings representing all possibilities for what our original coordinates could have been.
+我们有一些二维坐标，如 `(1, 3)` 或 `(2, 0.5)`，然后我们移除所有逗号，小数点和空格，得到一个字符串`S`。返回所有可能的原始字符串到一个列表中。
 
-Our original representation never had extraneous zeroes, so we never started with numbers like "00", "0.0", "0.00", "1.0", "001", "00.01", or any other number that can be represented with less digits.  Also, a decimal point within a number never occurs without at least one digit occuring before it, so we never started with numbers like ".1".
+原始的坐标表示法不会存在多余的零，所以不会出现类似于"00", "0.0", "0.00", "1.0", "001", "00.01"或一些其他更小的数来表示坐标。此外，一个小数点前至少存在一个数，所以也不会出现“.1”形式的数字。
 
-The final answer list can be returned in any order.  Also note that all coordinates in the final answer have exactly one space between them (occurring after the comma.)
+最后返回的列表可以是任意顺序的。而且注意返回的两个数字中间（逗号之后）都有一个空格。
 
-[subs="verbatim,quotes,macros"]
-----
-*Example 1:*
-*Input:* "(123)"
-*Output:* ["(1, 23)", "(12, 3)", "(1.2, 3)", "(1, 2.3)"]
-----
+....
+示例 1:
+输入: "(123)"
+输出: ["(1, 23)", "(12, 3)", "(1.2, 3)", "(1, 2.3)"]
+....
 
-[subs="verbatim,quotes,macros"]
-----
-*Example 2:*
-*Input:* "(00011)"
-*Output:*  ["(0.001, 1)", "(0, 0.011)"]
-*Explanation:* 
-0.0, 00, 0001 or 00.01 are not allowed.
-----
+....
+示例 2:
+输入: "(00011)"
+输出:  ["(0.001, 1)", "(0, 0.011)"]
+解释:
+0.0, 00, 0001 或 00.01 是不被允许的。
+....
 
-[subs="verbatim,quotes,macros"]
-----
-*Example 3:*
-*Input:* "(0123)"
-*Output:* ["(0, 123)", "(0, 12.3)", "(0, 1.23)", "(0.1, 23)", "(0.1, 2.3)", "(0.12, 3)"]
-----
+....
+示例 3:
+输入: "(0123)"
+输出: ["(0, 123)", "(0, 12.3)", "(0, 1.23)", "(0.1, 23)", "(0.1, 2.3)", "(0.12, 3)"]
+....
 
-[subs="verbatim,quotes,macros"]
-----
-*Example 4:*
-*Input:* "(100)"
-*Output:* [(10, 0)]
-*Explanation:* 
-1.0 is not allowed.
-----
+....
+示例 4:
+输入: "(100)"
+输出: [(10, 0)]
+解释:
+1.0 是不被允许的。
+....
 
- 
+*提示:*
 
-*Note: *
+* `4 \<= S.length \<= 12`.
+* `S[0] = (`, `S[S.length - 1] = )`, 且字符串 `S` 中的其他元素都是数字。
 
 
-* `4 <= S.length <= 12`.
-* `S[0]` = "(", `S[S.length - 1]` = ")", and the other elements in `S` are digits.
 
+== 思路分析
 
- 
+将字符串进行分割，然后给每个分割的字符串添加小数点，要排除非法数字的情况。
 
+image::images/0816-10.png[{image_attr}]
 
 
 [[src-0816]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0816_AmbiguousCoordinates.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0816_AmbiguousCoordinates_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
 
+. https://leetcode.cn/problems/ambiguous-coordinates/solutions/1951931/mo-hu-zuo-biao-by-leetcode-solution-y1yz/[816. 模糊坐标 - 官方题解^]
+. https://leetcode.cn/problems/ambiguous-coordinates/solutions/1953793/zhua-wa-mou-si-tu-jie-leetcode-by-muse-7-7y25/[816. 模糊坐标 - 图解LeetCode^]

docs/images/0816-10.png

@@ -1724,7 +1724,7 @@ include::0814-binary-tree-pruning.adoc[leveloffset=+1]
 
 include::0815-bus-routes.adoc[leveloffset=+1]
 
-// include::0816-ambiguous-coordinates.adoc[leveloffset=+1]
+include::0816-ambiguous-coordinates.adoc[leveloffset=+1]
 
 include::0817-linked-list-components.adoc[leveloffset=+1]
 

docs/index.adoc

@@ -1001,6 +1001,11 @@ endif::[]
 |{doc_base_url}/0817-linked-list-components.adoc[题解]
 |✅ 链表。难得写得比官方题解更简洁。
 
+|{counter:codes}
+|{leetcode_base_url}/ambiguous-coordinates/[816. Ambiguous Coordinates^]
+|{doc_base_url}/0816-ambiguous-coordinates.adoc[题解]
+|✅ 枚举。字符串分割，然后添加小数点，排除非法数字。
+
 
 |===
 

logbook/202601.adoc

@@ -0,0 +1,51 @@
+package com.diguage.algo.leetcode;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _0816_AmbiguousCoordinates {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2026-07-11 21:53:24
+   */
+  public List<String> ambiguousCoordinates(String s) {
+    s = s.substring(1, s.length() - 1);
+    List<String> result = new ArrayList<>();
+    for (int i = 1; i < s.length(); i++) {
+      List<String> heads = toDecimal(s.substring(0, i));
+      if (heads.isEmpty()) {
+        continue;
+      }
+      List<String> tails = toDecimal(s.substring(i));
+      if (tails.isEmpty()) {
+        continue;
+      }
+      for (String h : heads) {
+        for (String t : tails) {
+          result.add('(' + h + ", " + t + ')');
+        }
+      }
+    }
+    return result;
+  }
+
+  private List<String> toDecimal(String s) {
+    List<String> result = new ArrayList<>();
+    for (int i = 0; i < s.length(); i++) {
+      String d = (i > 0 ? s.substring(0, i) + '.' : "") + s.substring(i);
+      if ((d.charAt(0) == '0' && d.length() > 1 && d.charAt(1) != '.')
+        || (d.contains(".") && d.charAt(d.length() - 1) == '0')) {
+        continue;
+      }
+      result.add(d);
+    }
+    return result;
+  }
+
+  // end::answer[]
+  static void main() {
+    new _0816_AmbiguousCoordinates().ambiguousCoordinates("(123)");
+  }
+}