Type Here to Get Search Results !

Container with most water leetcode solution.


 Container with most water leetcode solution.

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


n == height.length
2 <= n <= 105
0 <= height[i] <= 104

Container with most water java solution :-

class Solution {
    public int maxArea(int[] height) {
         int result = 0;
        int n = height.length;
        int left = 0;
        int right = n- 1;
        result = Math.min(height[left], height[right])*(right - left);
        //move short height each time
        while(left < right){
            if(height[left] <= height[right])
            result = Math.max(result, Math.min(height[left], height[right])*(right - left));
        return result;

Post a Comment