盛最多水的容器:link
1.题目分析
1.找两个柱子使体积最大,双指针策略,指针移动的方式不人容易想到,参考link
2.示例代码
class Solution {
public:
int maxArea(vector<int>& height) {
int ret = 0;
int left = 0, right = height.size() - 1;
while(left < right){
ret = max(ret, (right - left) * min(height[left], height[right]));
if(height[left] < height[right]){
left++;
}else{
right--;
}
}
return ret;
}
};