摘要: 问题描述:给定字符串S,子串T,求S中包含T的最小窗口 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 阅读全文
posted @ 2016-08-20 21:40 32ddd 阅读(271) 评论(0) 推荐(0)