关闭

leetcode Trapping Rain Water

600人阅读 评论(0) 收藏 举报
分类:

Trapping Rain Water

 Total Accepted: 2335 Total Submissions: 8464My Submissions

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!

Discuss



Find the highest, then from the start to the highest, then the last to the highest..

class Solution {
 public:
  int trap(int A[], int n) {
    if (n <= 2)
      return 0;
    int i, maxElevation = A[0], maxIndex = 0, h = 0, res = 0;
    for (i = 1; i < n; ++i)
      if (A[i] > maxElevation) {
        maxElevation = A[i];
        maxIndex = i;
      }
    for (i = 0; i <= maxIndex - 1; ++i) 
      if (A[i] >= h)
        h = A[i];
      else
        res += (h - A[i]);
    
    h = 0;
    for (i = n - 1; i >= maxIndex + 1; --i) 
      if (A[i] >= h)
        h = A[i];
      else
        res += (h - A[i]);
    return res;
  }
};


1
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:284745次
    • 积分:4747
    • 等级:
    • 排名:第6441名
    • 原创:154篇
    • 转载:234篇
    • 译文:0篇
    • 评论:8条
    文章分类
    最新评论