From 2607bb8863af771d09f80e65a11fab8db7cbdcee Mon Sep 17 00:00:00 2001
From: kevin <wanjunfeng@gmail.com>
Date: Wed, 19 Aug 2020 18:19:38 +0800
Subject: [PATCH] update image alt in doc

---
 doc/keywords.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/doc/keywords.md b/doc/keywords.md
index 33b6686c..35ae6c76 100644
--- a/doc/keywords.md
+++ b/doc/keywords.md
@@ -4,7 +4,7 @@
 
 利用高效的Trie树建立关键词树，如下图所示，然后依次查找字符串中的相连字符是否形成树的一条路径
 
-![trie]<img src="images/trie.png" width="350" />
+<img src="images/trie.png" alt="trie" width="350" />
 
 发现掘金上[这篇文章](https://juejin.im/post/6844903750490914829)写的比较详细，可以一读，具体原理在此不详述。