【LeetCode算法练习（C++）】Container With Most Water

题目：
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 and n is at least 2.

链接：Container With Most Water
解法：两个指针分别从容器左右向内移动，直到相遇，检查过程中构成容量最大的容器。时间O(n)

class Solution {
public:
    int maxArea(vector<int>& height) {
        int lp = 0, rp = height.size() - 1;
        int ans = 0;
        while (lp < rp) {
            int maxHeight = height[rp] > height[lp] ? height[lp] : height[rp];
            ans = ans > ((rp - lp) * maxHeight) ? ans : ((rp - lp) * maxHeight);
            if (maxHeight == height[rp]) rp--;
            else lp++;
        }
        return ans;
    }
};

Runtime: 22 ms