leetcode-11-container with most water

class Solution {
public:
    int maxArea(vector<int>& height) {
        int i = 0;
        int j = height.size()-1;
        int result = 0;
        while(i < j){
            result = max(result, min(height[i], height[j])*(j-i));
            height[i] < height[j] ? i++ : j--;
        }
        return result;
    }
};

维护两个指针，然后往中间靠拢，移动时需要判断两个指针所指的高度的大小。