一刷1410

Author: diguage

README.adoc

@@ -9896,12 +9896,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|Medium
 //|
 
-//|{counter:codes}
-//|{leetcode_base_url}/html-entity-parser/[1410. HTML Entity Parser^]
-//|{source_base_url}/_1410_HtmlEntityParser.java[Java]
-//|{doc_base_url}/1410-html-entity-parser.adoc[题解]
-//|Medium
-//|
+|{counter:codes}
+|{leetcode_base_url}/html-entity-parser/[1410. HTML Entity Parser^]
+|{source_base_url}/_1410_HtmlEntityParser.java[Java]
+|{doc_base_url}/1410-html-entity-parser.adoc[题解]
+|Medium
+|
 
 //|{counter:codes}
 //|{leetcode_base_url}/number-of-ways-to-paint-n-3-grid/[1411. Number of Ways to Paint N × 3 Grid^]

docs/1410-html-entity-parser.adoc

@@ -1,55 +1,67 @@
 [#1410-html-entity-parser]
-= 1410. HTML Entity Parser
+= 1410. HTML 实体解析器
 
-{leetcode}/problems/html-entity-parser/[LeetCode - 1410. HTML Entity Parser ^]
+https://leetcode.cn/problems/html-entity-parser/[LeetCode - 1410. HTML 实体解析器 ^]
 
-*HTML entity parser* is the parser that takes HTML code as input and replace all the entities of the special characters by the characters itself.
+「HTML 实体解析器」 是一种特殊的解析器，它将 HTML 代码作为输入，并用字符本身替换掉所有这些特殊的字符实体。
 
-The special characters and their entities for HTML are:
+HTML 里这些特殊字符和它们对应的字符实体包括：
 
+* **双引号：**字符实体为 `"` ，对应的字符是 `"` 。
+* **单引号：**字符实体为 `'` ，对应的字符是 `'` 。
+* **与符号：**字符实体为 `&` ，对应对的字符是 `&` 。
+* **大于号：**字符实体为 `>` ，对应的字符是 `>` 。
+* **小于号：**字符实体为 `&lt;` ，对应的字符是 `<` 。
+* **斜线号：**字符实体为 `&frasl;` ，对应的字符是 `/` 。
 
-* *Quotation Mark:* the entity is `&amp;quot;` and symbol character is `"`.
-* *Single Quote Mark:* the entity is `&amp;apos;` and symbol character is `'`.
-* *Ampersand:* the entity is `&amp;amp;` and symbol character is `&amp;`.
-* *Greater Than Sign:* the entity is `&amp;gt;` and symbol character is `>`.
-* *Less Than Sign:* the entity is `&amp;lt;` and symbol character is `<`.
-* *Slash:* the entity is `&amp;frasl;` and symbol character is `/`.
+给你输入字符串 `text` ，请你实现一个 HTML 实体解析器，返回解析器解析后的结果。
 
+*示例 1：*
 
-Given the input `text` string to the HTML parser, you have to implement the entity parser.
+....
+输入：text = "&amp; is an HTML entity but &ambassador; is not."
+输出："& is an HTML entity but &ambassador; is not."
+解释：解析器把字符实体 &amp; 用 & 替换
+....
 
-Return _the text after replacing the entities by the special characters_.
+*示例 2：*
 
- 
-*Example 1:*
+....
+输入：text = "and I quote: &quot;...&quot;"
+输出："and I quote: \"...\""
+....
 
-[subs="verbatim,quotes"]
-----
-*Input:* text = "&amp;amp; is an HTML entity but &amp;ambassador; is not."
-*Output:* "&amp; is an HTML entity but &amp;ambassador; is not."
-*Explanation:* The parser will replace the &amp;amp; entity by &amp;
-----
+*示例 3：*
 
-*Example 2:*
+....
+输入：text = "Stay home! Practice on Leetcode :)"
+输出："Stay home! Practice on Leetcode :)"
+....
 
-[subs="verbatim,quotes"]
-----
-*Input:* text = "and I quote: &amp;quot;...&amp;quot;"
-*Output:* "and I quote: \"...\""
-----
+*示例 4：*
+
+....
+输入：text = "x &gt; y &amp;&amp; x &lt; y is always false"
+输出："x > y && x < y is always false"
+....
 
- 
-*Constraints:*
+*示例 5：*
 
+....
+输入：text = "leetcode.com&frasl;problemset&frasl;all"
+输出："leetcode.com/problemset/all"
+....
 
-* `1 <= text.length <= 10^5^`
-* The string may contain any possible characters out of all the 256 ASCII characters.
 
+*提示：*
 
+* `+1 <= text.length <= 10^5+`
+* 字符串可能包含 256 个ASCII 字符中的任意字符。
 
 
 == 思路分析
 
+将实体存入 `Map`，然后逐个字符读取，遇到开头 `&` 和结尾 `;` 就专门处理一下。
 
 [[src-1410]]
 [tabs]
@@ -76,4 +88,5 @@ include::{sourcedir}/_1410_HtmlEntityParser.java[tag=answer]
 
 == 参考资料
 
-
+. https://leetcode.cn/problems/html-entity-parser/solutions/2477551/html-shi-ti-jie-xi-qi-by-leetcode-soluti-y851/[1410. HTML 实体解析器 - 官方题解^] -- 在字符串中查找实体，这样处理更简单！
+. https://leetcode.cn/problems/html-entity-parser/solutions/2538217/gong-shui-san-xie-jing-dian-zi-fu-chuan-rvdh3/[1410. HTML 实体解析器 - 经典字符串处理与哈希表运用^]

docs/index.adoc

@@ -2903,7 +2903,7 @@ include::1349-maximum-students-taking-exam.adoc[leveloffset=+1]
 
 // include::1409-queries-on-a-permutation-with-key.adoc[leveloffset=+1]
 
-// include::1410-html-entity-parser.adoc[leveloffset=+1]
+include::1410-html-entity-parser.adoc[leveloffset=+1]
 
 // include::1411-number-of-ways-to-paint-n-3-grid.adoc[leveloffset=+1]
 

logbook/202503.adoc

@@ -778,6 +778,11 @@ endif::[]
 |{doc_base_url}/1457-pseudo-palindromic-paths-in-a-binary-tree.adoc[题解]
 |✅ 回溯，深度优先遍历，到叶子节点判断是否可以组成回文。
 
+|{counter:codes2503}
+|{leetcode_base_url}/html-entity-parser/[1410. HTML 实体解析器^]
+|{doc_base_url}/1410-html-entity-parser.adoc[题解]
+|✅ 哈希 + 字符串
+
 |===
 
 截止目前，本轮练习一共完成 {codes2503} 道题。

src/main/java/com/diguage/algo/leetcode/_1410_HtmlEntityParser.java

@@ -0,0 +1,61 @@
+package com.diguage.algo.leetcode;
+
+import java.util.Map;
+
+public class _1410_HtmlEntityParser {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-05-22 22:59:23
+   */
+  public String entityParser(String text) {
+    Map<String, String> map = Map.of(
+      "&quot;", "\"",
+      "&apos;", "'",
+      "&amp;", "&",
+      "&gt;", ">",
+      "&lt;", "<",
+      "&frasl;", "/");
+    StringBuilder sb = new StringBuilder();
+    boolean flag = false;
+    StringBuilder temp = new StringBuilder();
+    for (int i = 0; i < text.length(); i++) {
+      char c = text.charAt(i);
+      if (c == '&') {
+        if (!temp.isEmpty()) {
+          sb.append(temp);
+          temp.setLength(0);
+        }
+        temp.append(c);
+        flag = true;
+      } else if (c == ';') {
+        temp.append(c);
+        String entry = temp.toString();
+        String s = map.get(entry);
+        if (s != null) {
+          sb.append(s);
+        } else {
+          sb.append(entry);
+        }
+        temp.setLength(0);
+        flag = false;
+      } else {
+        if (flag) {
+          temp.append(c);
+        } else {
+          sb.append(c);
+        }
+      }
+    }
+    if (!temp.isEmpty()) {
+      sb.append(temp);
+    }
+    return sb.toString();
+  }
+
+  // end::answer[]
+  public static void main(String[] args) {
+    new _1410_HtmlEntityParser()
+      .entityParser("&amp; is an HTML entity but &ambassador; is not.");
+  }
+}