摘要：Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the 阅读全文

摘要：这两题有一个 trick 和 Minimum Window Substring 非常像，就是维护一个 "curCount" 代表目前 (i,j) 之间 match 上的数量，而通过 hash[] 的正负充当计数器的作用 参照 k characters: http://www.cnblogs.com/ 阅读全文

摘要：ou are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concat 阅读全文

摘要：https://leetcode.com/problems/minimum-size-subarray-sum/#/solutions Since the given array contains only positive integers, the subarray sum can only i 阅读全文