From 8e9b6ee30e0af8fe1cae5d378c41b25895a7060a Mon Sep 17 00:00:00 2001
From: YangFong <70502828+YangFong@users.noreply.github.com>
Date: Wed, 9 Mar 2022 14:30:08 +0800
Subject: [PATCH] docs: add a description of the solution to lcci problem:
 No.01.02

No.01.02.Check Permutation
---
 lcci/01.02.Check Permutation/README.md | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

diff --git a/lcci/01.02.Check Permutation/README.md b/lcci/01.02.Check Permutation/README.md
index bbd715f6317c3..baef49b6d1f72 100644
--- a/lcci/01.02.Check Permutation/README.md	
+++ b/lcci/01.02.Check Permutation/README.md	
@@ -30,7 +30,13 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-用一个哈希表作为字符计数器，`O(n)` 时间内解决。
+**方法一：**
+
+使用哈希表作为字符计数器，`O(n)` 时间内解决。
+
+**方法二：**
+
+按照字符编码重新排序字符串，再检查两者一致性。
 
 <!-- tabs:start -->