一刷890

Author: diguage

README.adoc

@@ -6255,14 +6255,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0889-construct-binary-tree-from-preorder-and-postorder-traversal.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/find-and-replace-pattern/[890. Find and Replace Pattern^]
-//|{source_base_url}/_0890_FindAndReplacePattern.java[Java]
-//|{doc_base_url}/0890-find-and-replace-pattern.adoc[题解]
-//|Medium
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/find-and-replace-pattern/[890. Find and Replace Pattern^]
+|{source_base_url}/_0890_FindAndReplacePattern.java[Java]
+|{doc_base_url}/0890-find-and-replace-pattern.adoc[题解]
+|Medium
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/sum-of-subsequence-widths/[891. Sum of Subsequence Widths^]
 //|{source_base_url}/_0891_SumOfSubsequenceWidths.java[Java]

docs/0890-find-and-replace-pattern.adoc

@@ -1,47 +1,66 @@
 [#0890-find-and-replace-pattern]
-= 890. Find and Replace Pattern
+= 890. 查找和替换模式
 
-{leetcode}/problems/find-and-replace-pattern/[LeetCode - Find and Replace Pattern^]
+https://leetcode.cn/problems/find-and-replace-pattern/[LeetCode - 890. 查找和替换模式 ^]
 
-You have a list of `words` and a `pattern`, and you want to know which words in `words` matches the pattern.
+你有一个单词列表 `words` 和一个模式  `pattern`，你想知道 `words` 中的哪些单词与模式匹配。
 
-A word matches the pattern if there exists a permutation of letters `p` so that after replacing every letter `x` in the pattern with `p(x)`, we get the desired word.
+如果存在字母的排列 `p` ，使得将模式中的每个字母 `x` 替换为 `p(x)` 之后，我们就得到了所需的单词，那么单词与模式是匹配的。
 
-(_Recall that a permutation of letters is a bijection from letters to letters: every letter maps to another letter, and no two letters map to the same letter._)
+_（回想一下，字母的排列是从字母到字母的双射：每个字母映射到另一个字母，没有两个字母映射到同一个字母。）_
 
-Return a list of the words in `words` that match the given pattern. 
+返回 `words` 中与给定模式匹配的单词列表。
 
-You may return the answer in any order.
+你可以按任何顺序返回答案。
 
- 
+*示例：*
 
+....
+输入：words = ["abc","deq","mee","aqq","dkd","ccc"], pattern = "abb"
+输出：["mee","aqq"]
+解释：
+"mee" 与模式匹配，因为存在排列 {a -> m, b -> e, ...}。
+"ccc" 与模式不匹配，因为 {a -> c, b -> c, ...} 不是排列。
+因为 a 和 b 映射到同一个字母。
+....
 
-*Example 1:*
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* words = ["abc","deq","mee","aqq","dkd","ccc"], pattern = "abb"
-*Output:* ["mee","aqq"]
-*Explanation:* "mee" matches the pattern because there is a permutation {a -> m, b -> e, ...}.
-"ccc" does not match the pattern because {a -> c, b -> c, ...} is not a permutation,
-since a and b map to the same letter.
-----
-
- 
-
-*Note:*
+*提示：*
 
-
-* `1 <= words.length <= 50`
-* `1 <= pattern.length = words[i].length <= 20`
+* `+1 <= words.length <= 50+`
+* `+1 <= pattern.length = words[i].length <= 20+`
 
 
+== 思路分析
 
+建立一个字母映射，并且每个字母只能有一种映射关系。否则就不匹配。
 
+看官方题解，可以建立双向映射： `src → tgt` 和 `tgt → src`，如果都可以，则匹配。这样的方式更简单。
 
 [[src-0890]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0890_FindAndReplacePattern.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0890_FindAndReplacePattern_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
 
+. https://leetcode.cn/problems/find-and-replace-pattern/solutions/1593882/cha-zhao-he-ti-huan-mo-shi-by-leetcode-s-fyyg/[890. 查找和替换模式 - 查找和替换模式^]
+. https://leetcode.cn/problems/find-and-replace-pattern/solutions/1595777/by-ac_oier-s4cw/[890. 查找和替换模式 - 简单哈希表模拟题^]

docs/index.adoc

@@ -1863,7 +1863,7 @@ include::0881-boats-to-save-people.adoc[leveloffset=+1]
 
 // include::0889-construct-binary-tree-from-preorder-and-postorder-traversal.adoc[leveloffset=+1]
 
-// include::0890-find-and-replace-pattern.adoc[leveloffset=+1]
+include::0890-find-and-replace-pattern.adoc[leveloffset=+1]
 
 // include::0891-sum-of-subsequence-widths.adoc[leveloffset=+1]
 

logbook/202503.adoc

@@ -808,6 +808,12 @@ endif::[]
 |{doc_base_url}/0841-keys-and-rooms.adoc[题解]
 |✅ 深度优先遍历或广度优先遍历。
 
+|{counter:codes2503}
+|{leetcode_base_url}/find-and-replace-pattern/[890. 查找和替换模式^]
+|{doc_base_url}/0890-find-and-replace-pattern.adoc[题解]
+|✅ 映射。建立一个字母映射，并且每个字母只能有一种映射关系。否则就不匹配。
+
+
 
 |===
 

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

@@ -0,0 +1,38 @@
+package com.diguage.algo.leetcode;
+
+import java.util.*;
+
+public class _0890_FindAndReplacePattern {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-05-24 20:56:15
+   */
+  public List<String> findAndReplacePattern(String[] words, String pattern) {
+    List<String> result = new ArrayList<>();
+    for (String word : words) {
+      StringBuilder sb = new StringBuilder(word);
+      Set<Character> set = new HashSet<>();
+      Map<Character, String> map = new HashMap<>();
+      for (int i = 0; i < word.length(); i++) {
+        char pc = pattern.charAt(i);
+        char wc = word.charAt(i);
+        if (!map.containsKey(wc) && !set.contains(pc)) {
+          map.put(wc, String.valueOf(pc));
+          set.add(pc);
+          sb.replace(i, i + 1, map.get(wc));
+        } else if (map.containsKey(wc)) {
+          sb.replace(i, i + 1, map.get(wc));
+        } else {
+          break;
+        }
+      }
+      if (sb.toString().equals(pattern)) {
+        result.add(word);
+      }
+    }
+    return result;
+  }
+  // end::answer[]
+}