LeetCode 11. Container With Most Water

Question

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 the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.

https://leetcode.com/problems/container-with-most-water/

• Solution1

class Solution {
    public int maxArea(int[] height) {
        if (height == null || height.length < 2) return 0;
        int area = 0;
        int left = 0;
        int right = height.length - 1;
        while (left < right) {
            area = Math.max(area, (right - left) * Math.min(height[left], height[right]));
            if (height[left] > height[right]) right--;
            else if (height[left] < height[right]) left++;
            //left = right
            else {
                left++;
                right--;
            }
        }
        return area;
    }
}

Complexity:

Time complexity: O( n)

Space complexity: O(1)