2017年10月4日
leetcode 76. Minimum Window Substring
摘要： link 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 = "ADO 阅读全文
posted @ 2017-10-04 23:58 bbbbq 阅读(135) 评论(0) 推荐(0) 编辑
leetcode 72. Edit Distance
摘要： link Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You 阅读全文
posted @ 2017-10-04 23:13 bbbbq 阅读(123) 评论(0) 推荐(0) 编辑