leetcode之11. Container With Most Water（C++解法）

原题：
Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container.
*******************************我是分割线*****************************
class Solution {
public:
int maxArea(vector& height) {
if(height.size()<2)
return 0;
int area=0;
int a=0,b=height.size()-1;
//area=mix(a,b)*(height.size()-1);
while(a