Trapping Rain Water (最大盛水量）

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!

这道题题意比较好理解 但是我个人在很多临界值上遇到了点问题 提交了5次才AC 这里算法先分别计算从最左边和最右边数递增最高的黑色方块位置与高度， leftHeight, leftPos, rightHeight, rightPos，然后判断左右位置是否有效，在进行循环计算，从最左边和最右边高度最小的一边开始循环，更新Height直到循环退出。

class Solution {
public:
	int trap(int A[], int n) {
		if (n < 3) return 0;
		int water = 0, leftPos = 0, rightPos = n - 1;
		int leftHeight = 0, rightHeight = 0;
		//计算左边数最高的位置
		for (int i = 0; i < n; ++i)
		{
			if (A[i] >= leftHeight)
			{
				leftHeight = A[i];
				leftPos = i;
			}
			else
				break;
		}
		//计算右边数最高的位置
		for (int i = n - 1; i >= 0; --i)
		{
			if (A[i] >= rightHeight)
			{
				rightHeight = A[i];
				rightPos = i;
			}
			else 
				break;
		}
		if (leftPos >= rightPos - 1) return 0;
		while (leftPos < rightPos - 1)
		{
			if (leftHeight <= rightHeight)
			{
				if (A[leftPos + 1] >= leftHeight)
					leftHeight = A[leftPos + 1];
				else
					water += leftHeight - A[leftPos + 1];
				++leftPos;
			}
			else
			{
				if (A[rightPos - 1] >= rightHeight)
					rightHeight = A[rightPos - 1];
				else
					water += rightHeight - A[rightPos - 1];
				--rightPos;
			}
		}
		return water;
	}
};