[LeetCode] 11. Container With Most Water

Problem

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

Notice that you may not slant the container.

Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: 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 2:

Input: height = [1,1]
Output: 1

Constraints:

• n == height.length
• 2 <= n <= 10^5
• 0 <= height[i] <= 10^4

Solution

Algorithm

Complexity Analysis

• Time Complexity

배열의 길이(n)에 관계 없이 while반복문(4)는 배열의 길이(n)의 절반만 실행된다. 따라서 모든 경우에 O(n)의 시간 복잡도를 가진다.

• Space Complexity

배열의 길이(n)에 따라 감소하거나 증가하여 할당받는 공간없이 일정한 공간을 할당받으므로 모든 경우에 O(1)의 공간 복잡도를 가진다.