Leetcode 42. Trapping Rain Water
来源：互联网 发布：网络免费打电话 编辑：程序博客网 时间：2024/04/28 15:50
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!
public class Solution { public int trap(int[] height) { int length = height.length; int maxL = new int[length]; int maxR = new int[length]; if(n <= 2) return 0; int max = 0; for(int i = 1; i < n - 1; i ++){ maxL[i] = max; if(max < height[i]) max = A[i]; } max = A[n - 1] maxR[n - 1] = 0; int ctrap,ttrap = 0; for(int i = n-2; i > 0; i--){ maxR[i] = max; ctra[] } }} 0 0
- [LeetCode]42.Trapping Rain Water
- LeetCode --- 42. Trapping Rain Water
- LeetCode 42.Trapping Rain Water
- [Leetcode] 42. Trapping Rain Water
- [leetcode] 42.Trapping Rain Water
- 【leetcode】42. Trapping Rain Water
- ***LeetCode 42. Trapping Rain Water
- Leetcode 42. Trapping Rain Water
- leetcode 42. Trapping Rain Water
- [LeetCode]42. Trapping Rain Water
- leetcode 42. Trapping Rain Water
- LeetCode 42. Trapping Rain Water
- LeetCode 42. Trapping Rain Water
- LeetCode 42. Trapping Rain Water
- leetcode.42. Trapping Rain Water
- [leetcode] 42. Trapping Rain Water
- LeetCode-42.Trapping Rain Water
- LeetCode 42. Trapping Rain Water
- android高级框架xUtils之DbUtils
- Maven学习之 Elipse中发布一个Maven项目到Tomcat (五)
- DEBUG模式下, 内存中的变量地址分析
- Web表单（Flask-WTF）
- POJ 3422 Kaka's Matrix Travels （最大费用最大流）
- Leetcode 42. Trapping Rain Water
- android彩信数据字段
- Maven学习之搭建多模块企业级项目 (六)
- 【C++】基于 OpenCV 的人脸识别(强烈推荐)
- ZMQ源码分析（一）-- 基础数据结构的实现
- OSI/RM开放系统互联参考模型
- x265-1.7版本-encoder/reference.cpp注释
- UI_封装
- 责任链模式
