码迷,mamicode.com
首页 > 移动开发 > 详细

42. Trapping Rain Water

时间:2015-04-17 23:51:07      阅读:163      评论: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
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!