2018年3月31日
[LeetCode] 727. Minimum Window Subsequence 最小窗口序列
摘要： Given strings S and T, find the minimum (contiguous) substring W of S, so that T is a subsequence of W. If there is no such window in S that covers al 阅读全文
posted @ 2018-03-31 23:54 Grandyang 阅读(15281) 评论(6) 推荐(1)
Fork me on GitHub