首页 > 移动平台 > 详细

42. Trapping Rain Water

时间:2015-04-17 23:48:21      阅读:181      评论:0      收藏:0      [点我收藏+]

题目:

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!

链接:

题解:

测试:

42. Trapping Rain Water

原文:http://www.cnblogs.com/yrbbest/p/4436338.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!