From 6cb1cd6cd0b3df1323584ffc37f0709903cdf5f7 Mon Sep 17 00:00:00 2001
From: Shen <shen.h@outlook.com>
Date: Wed, 12 Jul 2023 09:05:43 +0800
Subject: [PATCH] Replace cur is not None logic

---
 .../06.String/03.String-Multi-Pattern-Matching/01.Trie.md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md b/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md
index 4ae97ce4..1d7ff1e4 100644
--- a/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md
+++ b/Contents/06.String/03.String-Multi-Pattern-Matching/01.Trie.md
@@ -125,7 +125,7 @@ def search(self, word: str) -> bool:
             return False                    # 直接返回 False
         cur = cur.children[ch]              # 令当前节点指向新建立的节点,然后继续查找下一个字符
 
-    return cur is not None and cur.isEnd    # 判断当前节点是否为空,并且是否有单词结束标记
+    return cur.isEnd                        # 判断是否有单词结束标记
 ```
 
 #### 2.3.2 字典树的查找前缀操作
@@ -140,7 +140,7 @@ def startsWith(self, prefix: str) -> bool:
         if ch not in cur.children:          # 如果当前节点的子节点中,不存在键为 ch 的节点
             return False                    # 直接返回 False
         cur = cur.children[ch]              # 令当前节点指向新建立的节点,然后继续查找下一个字符
-    return cur is not None                  # 判断当前节点是否为空,不为空则查找成功
+    return True                             # 查找成功
 ```
 
 ## 3. 字典树的实现代码
@@ -175,7 +175,7 @@ class Trie:                                     # 字典树
                 return False                    # 直接返回 False
             cur = cur.children[ch]              # 令当前节点指向新建立的节点,然后继续查找下一个字符
 
-        return cur is not None and cur.isEnd    # 判断当前节点是否为空,并且是否有单词结束标记
+        return cur.isEnd                        # 判断是否有单词结束标记
 
     # 查找字典树中是否存在一个前缀
     def startsWith(self, prefix: str) -> bool:
@@ -184,7 +184,7 @@ class Trie:                                     # 字典树
             if ch not in cur.children:          # 如果当前节点的子节点中,不存在键为 ch 的节点
                 return False                    # 直接返回 False
             cur = cur.children[ch]              # 令当前节点指向新建立的节点,然后继续查找下一个字符
-        return cur is not None                  # 判断当前节点是否为空,不为空则查找成功
+        return True                             # 查找成功
 ```
 
 ## 4. 字典树的算法分析