Leetcode
Clam30
这个作者很懒,什么都没留下…
展开
-
Leetcode-Unique Substrings in Wraparound String
Leetcode原创 2017-03-03 21:59:04 · 171 阅读 · 0 评论 -
Trapping Rain Water-Leetcode
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]原创 2017-03-29 17:11:12 · 143 阅读 · 0 评论 -
Remove K Digits
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible. Note: The length of num is less than 10002 and will b原创 2017-03-29 17:19:53 · 170 阅读 · 0 评论 -
Trapping Rain Water II
Given an m x n matrix of positive integers representing the height of each unit cell in a 2D elevation map, compute the volume of water it is able to trap after raining. Note: Both m and n are l原创 2017-04-04 20:47:04 · 156 阅读 · 0 评论 -
The Skyline Problem
A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are given the locations and height of all the buildings as原创 2017-04-05 21:50:42 · 156 阅读 · 0 评论 -
leetcode-Remove Boxes
/* * 采用记忆搜索 * dp[left][right][k]:boxes编号从left到right,且左边有k个boxe跟boxes[left]相同 * 思路:左边的k个可以先跟boxes[left]移除,也可以保留下来跟右边的bxoes[left]相同的移除 * dp[left][right][k]=Max{(k+1)^2+dp[left+1][right][0],max(dp[le原创 2017-06-12 08:55:39 · 226 阅读 · 0 评论