leetcode-11:Container With Most Water盛最多水的容器
阿新 • • 發佈：2018-12-22
題目：
| Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water. Note: You may not slant the container and n is at least 2.
The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
Example: Input: [1,8,6,2,5,4,8,3,7] Output: 49 |
給定 n 說明：你不能傾斜容器，且 n 的值至少為 2。 圖中垂直線代表輸入陣列 [1,8,6,2,5,4,8,3,7]。在此情況下，容器能夠容納水（表示為藍色部分）的最大值為 49。
示例: 輸入: [1,8,6,2,5,4,8,3,7] 輸出: |
思路：求最大，可以從兩邊向中間算。令i從左邊開始，j從右邊開始。height[i]和height[j]越接近越好，每次左右兩端捨棄小的那一端就行。
class Solution {
public:
int maxArea(vector<int>& height) {
int j=height.size()-1,i=0,ret=0;
while(i<j)
{
ret = max(ret,min(height[i],height[j])*(j-i));
height[j]>height[i]?i++:j--;
}return ret;
}
};