Yumeng Li’s Blog

题目:Trapping Rain Water

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], return 6.

The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!

点击继续阅读 | Read on →

最近比较闲,便抽出一部分时间在github上搭建了这个博客。 应该是很早之前就有这个想法了,因为各种原因一拖再拖。今天终于可以为此庆贺一下了。 好久不写这类文字了,竟不知道写什么了,今天在此Mark一下吧,以后争取经常更新。