![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
贪心
njudongchen
这个作者很懒,什么都没留下…
展开
-
container-with-most-water
Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lin原创 2017-04-19 11:03:49 · 272 阅读 · 0 评论 -
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 =”ADOBECODEBANC” T =”ABC” Minimum window is”BANC”. Note:原创 2017-05-04 21:22:52 · 376 阅读 · 0 评论