2019年1月1日
76. Minimum Window Substring
摘要： 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 @ 2019-01-01 04:07 回到明天 阅读(96) 评论(0) 推荐(0)
3. Longest Substring Without Repeating Characters
摘要： Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文
posted @ 2019-01-01 03:57 回到明天 阅读(120) 评论(0) 推荐(0)