2016年7月16日

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). For example,S = "ADOBECOD 阅读全文

posted @ 2016-07-16 23:02 Sheryl Wang 阅读(152) 评论(0) 推荐(0) 编辑

Minimum Size Subarray Sum

摘要： Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 阅读全文

posted @ 2016-07-16 22:16 Sheryl Wang 阅读(177) 评论(0) 推荐(0) 编辑

导航