【LeetCode-11】盛水最多的容器

class Solution {
public:
	int maxArea(vector<int>& height) {
		int i,a=0,b=height.size()-1,volumn=0;
		for (i = 0; a<b && i<height.size(); i++)
		{
			
			int minValue = min(height[a], height[b]);
			
			if ((b - a)*(minValue) > volumn)
				volumn = (b - a)*(minValue);
			
			height[a]>height[b] ? b -= 1: a += 1;

		}

		return volumn;
	}
};