sinat_28088761的博客

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]

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

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

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

/** 采用记忆搜索* 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