![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
xx77009833
这个作者很懒,什么都没留下…
展开
-
[leetcode] Permutations
Permutations Total Accepted: 5072 Total Submissions: 16450Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,原创 2014-01-04 14:56:34 · 517 阅读 · 0 评论 -
[leetcode] Longest Valid Parentheses DP~!
http://leetcodenotes.wordpress.com/2013/10/19/leetcode-longest-valid-parentheses-%E8%BF%99%E7%A7%8D%E6%8B%AC%E5%8F%B7%E7%BB%84%E5%90%88%EF%BC%8C%E6%9C%80%E9%95%BF%E7%9A%84valid%E6%8B%AC%E5%8F%B7%E7%BB转载 2014-01-14 17:43:49 · 1508 阅读 · 0 评论 -
Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from th原创 2014-01-17 18:28:11 · 505 阅读 · 0 评论 -
[LeetCode] Largest Rectangle in Histogram
http://fisherlei.blogspot.com/2012/12/leetcode-largest-rectangle-in-histogram.html循环有不同的写法它这种i先动,j从i往左扫(往回扫)的方式,很适合第二种方法的剪枝,是从范围小到范围大,正好当后面比前面大的话,当前的i就没必要往前扫了,后面肯定比当前的i组成的面积大一般的i,j都往后扫,不好剪枝啊原创 2014-01-19 16:51:13 · 861 阅读 · 0 评论 -
[leetcode] Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and [2,1,1].原创 2014-01-04 16:30:41 · 4442 阅读 · 2 评论