摘要:
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 ="ADOBECODE 阅读全文
posted @ 2017-07-14 21:05
王大咩的图书馆
阅读(312)
评论(0)
推荐(1)
摘要:
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array[−2,1,−3,4,−1,2,1 阅读全文
posted @ 2017-07-14 16:11
王大咩的图书馆
阅读(392)
评论(0)
推荐(0)
摘要:
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2017-07-14 15:34
王大咩的图书馆
阅读(781)
评论(0)
推荐(0)
摘要:
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2017-07-14 10:49
王大咩的图书馆
阅读(333)
评论(0)
推荐(0)