摘要: 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).For example,S="ADOBECODEBA... 阅读全文
posted @ 2015-03-10 22:38 匡子语 阅读(311) 评论(0) 推荐(0)
摘要: Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.anagrams 的意思是两个词用相同的字母组成 比如 “dog" "go... 阅读全文
posted @ 2015-03-10 20:51 匡子语 阅读(200) 评论(0) 推荐(0)