题目:
解答:
首尾递推,保存最大值,遍历数组即可。
代码:
class Solution {
public:
int maxArea(vector<int> &height) {
int area = 0;
int left = 0,right = height.size() - 1;
while( left < right ) {
int temp = height[left] > height[right] ? (right - left) * height[right] : (right - left) * height[left];
area = area > temp ? area : temp;
if( height[left] > height[right] ) right--;
else left++;
}
return area;
}
};
更新会同步在我的网站更新(https://zergzerg.cn/notes/webnotes/leetcode/index.html)