42. 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!

根据大佬的思路写的最简单的那种   http://blog.csdn.net/linhuanmars/article/details/20888505

class Solution
{
public:
	int trap(vector<int>&height)
	{
		if (height.size() < 2) return 0; 
		int sum = 0; 
		for (int i = 1; i < height.size()-1; ++i)
		{
			int left = i - 1; 
			int right = i + 1;  
			int num = height[i]; 
			int k = find(left, right, height); 
			if (num < k) sum += (k - num);
		}
		return sum;
	}
	int find(int left, int right, vector<int > & height)
	{
		int   a = height[left];
		int   b = height[right];
		while (left >= 0)
		{
			if (height[left]>a)
				a = height[left]; 
			--left; 
		}

		while (right < height.size())
		{
			if (height[right] > b)
				b = height[right];
			++right;  
		}

		return a > b ? b: a; 
	}
};