Skip to content

docs: add a description of the solution to lcci problem: No.01.02 #739

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Mar 9, 2022
Merged

docs: add a description of the solution to lcci problem: No.01.02 #739

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 7 additions & 1 deletion lcci/01.02.Check Permutation/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,13 @@

<!-- 这里可写通用的实现逻辑 -->

用一个哈希表作为字符计数器，`O(n)` 时间内解决。
**方法一：**

使用哈希表作为字符计数器，`O(n)` 时间内解决。

**方法二：**

按照字符编码重新排序字符串，再检查两者一致性。

<!-- tabs:start -->

Expand Down