add: 最小覆盖子串

2020-05-23 22:56:11 +08:00
parent 3395b76309
commit b710fc166d
4 changed files with 55 additions and 0 deletions
--- a/README.md
+++ b/README.md
@ -104,6 +104,11 @@ LeetCode 与 LintCode 解题记录。此为个人练习仓库，代码中对重

  - LeetCode 1371. 每个元音包含偶数次的最长子字符串 <https://leetcode-cn.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/>

+- [最小覆盖子串](src/string/minimum-window-substring.js)
+
+  - LeetCode 76. 最小覆盖子串 <https://leetcode-cn.com/problems/minimum-window-substring/>
+  -LintCode 1420. 最小覆盖子串II <https://www.lintcode.com/problem/minimum-window-substring-ii/description>
+
 ## 数组/队列/集合/映射

 - [电话号码的字母组合](src/array/letter-combinations-of-a-phone-number.js)