题解 | #盛水最多的容器#
盛水最多的容器
https://www.nowcoder.com/practice/3d8d6a8e516e4633a2244d2934e5aa47
class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param height int整型vector * @return int整型 */ int maxArea(vector<int>& height) { int minS = 0; if (height.size() < 2) return minS; int i = 0, j = height.size() - 1; while (j > i) { int minN = min(height[i], height[j]) * (j - i); if (minN > minS) minS = minN; if (height[i] < height[j]) i++; else j--; } return minS; } };