腾讯精选50题leetcode

题目：https://leetcode-cn.com/problems/container-with-most-water/

代码：
class Solution {
public:
int maxArea(vector& height) {
int water = 0;
int i = 0, j = height.size() - 1;
while (i < j) {
int h = min(height[i], height[j]);
water = max(water, (j - i) * h);
while (height[i] <= h && i < j) i++;
while (height[j] <= h && i < j) j–;
}
return water;
}
};