Search results
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.
- Description
Can you solve this real interview question? Container With...
- Description
Learn how to solve the medium level problem of finding the maximum area of a container with two vertical lines. See code examples in C++ and Python, and understand the logic and constraints.
Learn how to solve the problem of finding the maximum area of a container with two vertical lines using Java and Python codes. See examples, explanations, and time and space complexities.
Container With Most Water - 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.
class Solution { public: int maxArea(vector<int>& height) { int ans = 0; int l = 0; int r = height.size() - 1; while (l < r) { const int minHeight = min(height[l], height[r]); ans = max(ans, minHeight * (r - l)); if (height[l] < height[r]) ++l; else --r; } return ans; } }; 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18.
In-depth solution and explanation for LeetCode 11. Container With Most Water in Python, Java, C++ and more. Intuitions, example walk through, and complexity analysis.
Sep 10, 2023 · Learn how to find the maximum area of water a container can store using two vertical lines drawn from an array of heights. See the intuition, approach, complexity and code in Java.
