Leetcode Container with Most Water

左右夹逼，每一次都挪动较短的板子

    int maxArea(vector<int> &height) {        int i = 0, j = height.size()-1;        int maxx = 0;        int temp = 0;                   // assume no overflow        while(i < j){            if(height[i] < height[j])                temp = (j-i) * height[i++];            else                temp = (j-i) * height[j--];            maxx = max(maxx, temp);        }        return maxx;    }