algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-05 00:25:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

minor typo fix

Browse Source
This commit is contained in:
Yu Xia
2021-01-24 15:36:35 -08:00
parent 8747599780
commit aeda134392
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/0567.Permutation-in-String/README.md
View File

@ -28,7 +28,7 @@ Note:
## 题目大意
在一个字符串重寻找子串出现的位置。子串可以是 Anagrams 形式存在的。Anagrams 是一个字符串任意字符的全排列组合。
在一个字符串中寻找子串出现的位置。子串可以是 Anagrams 形式存在的。Anagrams 是一个字符串任意字符的全排列组合。
## 解题思路