Trapping Rain WaterGivennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to tr...
分类：
移动开发 时间：
2014-08-08 12:30:45
阅读次数：
193
题目：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 rain....
分类：
移动开发 时间：
2014-07-30 09:47:13
阅读次数：
272
#pragma warning(disable:4996)
#include <cstdio>
#include <tchar.h>
#include <Windows.h>
/*
submit time : 3
1.Time Limit Exceeded
Last executed input: []
2.Cant‘s remember
request :
G...
分类：
移动开发 时间：
2014-07-21 23:30:21
阅读次数：
443
class Solution {public: int trap(int A[], int n) { if (n peaks; vector peaks_tmp; int last_idx = 0; bool increasing = ...
分类：
移动开发 时间：
2014-07-21 09:04:11
阅读次数：
259
Givennnon-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.Fo...
分类：
移动开发 时间：
2014-07-18 11:38:45
阅读次数：
228
Givennnon-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.Fo...
分类：
移动开发 时间：
2014-07-10 15:00:57
阅读次数：
267
https://oj.leetcode.com/problems/trapping-rain-water/模拟题，计算出在凹凸处存水量。对于一个位置 i ，分别计算出它左边的最大值 left （从左扫描一遍）， 右边的最大值 right（从右扫描一遍） 。找left right中的最小值，如果大于 ...
分类：
移动开发 时间：
2014-06-28 16:32:30
阅读次数：
222
题目
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,...
分类：
移动开发 时间：
2014-06-27 23:20:39
阅读次数：
349
Givennnon-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.Fo...
分类：
移动开发 时间：
2014-06-27 16:53:38
阅读次数：
262
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.
分类：
移动开发 时间：
2014-06-27 12:51:24
阅读次数：
258
