题解 | #盛水最多的容器#
盛水最多的容器
https://www.nowcoder.com/practice/3d8d6a8e516e4633a2244d2934e5aa47?tpId=295&tqId=2284579&ru=%2Fpractice%2Fb56799ebfd684fb394bd315e89324fb4&qru=%2Fta%2Fformat-top101%2Fquestion-ranking&sourceUrl=%2Fexam%2Foj
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param height int整型vector
* @return int整型
*/
int maxArea(vector<int>& height) {
if (height.size() < 2) {
return 0;
}
int res = 0;
int left = 0, right = height.size() - 1;
while (left < right) {
int size = (right - left) * std::min(height[left], height[right]);
res = std::max(res, size);
// 每次更新下限要大于等于原来的水平
height[left] < height[right] ? ++left : --right;
}
return res;
}
};