题目描述：
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...
分类：
移动开发 时间：
2014-11-06 13:06:41
阅读次数：
239
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-10-30 01:41:48
阅读次数：
169
使用栈结构解决。#include #include using namespace std;class Solution {public: int trap(int A[], int n) { if (n water_stack; int begin=0; ...
分类：
移动开发 时间：
2014-10-29 12:12:50
阅读次数：
184
题目：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...
分类：
移动开发 时间：
2014-10-27 01:44:33
阅读次数：
231
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]...
分类：
移动开发 时间：
2014-10-26 14:26:31
阅读次数：
187
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-10-25 07:04:38
阅读次数：
181
题意：平面上有n条线段，一次给出这n条线段的两个端点的坐标。问怪兽能否从坐标原点逃到无穷远处。(两直线最多有一个交点，且没有三线共交点的情况)分析：首先说明一下线段的规范相交：就是交点唯一而且在两条线段的内部。如果输入中有一条线段uv没有和其他任何一条线段规范相交，那么怪兽一定是可以从u走到v的。所...
分类：
其他好文 时间：
2014-10-23 22:21:32
阅读次数：
352
[leetcode]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-10-22 10:05:30
阅读次数：
248
函数名: harderr
功 能: 建立一个硬件错误处理程序
用 法: void harderr(int (*fptr)());
程序例:
/*This program will trap disk errors and prompt
the user for action. Try running it with no
disk in drive A: to invoke i...
分类：
编程语言 时间：
2014-10-19 06:55:06
阅读次数：
165
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-10-11 05:30:54
阅读次数：
228
