[LeetCode] 11. Container With Most Water

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.

Analyse:

計算最高的水位,

由最外側開始算, 若左邊的高於右邊, 則右邊的index - 1, 反之.

Solution:

class Solution {
    
    func maxArea(_ height: [Int]) -> Int {
        var left = 0;
        var right = height.count - 1;
        var output = 0;
        
        while(left < right) {
            var value = 0;
            
            if(height[left] > height[right]) {
                value = (right - left) * height[right];
                right -= 1;
            }
            else {
                 value = (right - left) * height[left];
                left += 1;
            }
            
            output = max(output, value);
        }
        
        return output; 
    }
}