2020年6月8日
76. Minimum Window Substring 76.最小窗口子字符串
摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = "ADOB 阅读全文
posted @ 2020-06-08 21:43 苗妙苗 阅读(157) 评论(0) 推荐(0)
438. Find All Anagrams in a String 438.查找字符串中的所有Anagrams
摘要： Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the 阅读全文
posted @ 2020-06-08 10:30 苗妙苗 阅读(150) 评论(0) 推荐(0)