In the Leetcode Container With Most Water problem solution in C# programming, 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.
Leetcode Container With Most Water problem solution in C# programming
public class Solution
{
public int MaxArea(int[] height)
{
int l = 0, max = 0;
int r = height.Length - 1;
while (l < r)
{
// calculate area between l and r
int curArea = Math.Min(height[l], height[r]) * (r - l);
// move one of the 2 pointers inward greedily
if (height[l] <= height[r])
l++;
else
r--;
max = Math.Max(max, curArea);
}
return max;
}
}Also read,
- Leetcode Container With Most Water problem solution in C++
- Leetcode Container With Most Water problem solution in Java
- Leetcode Container With Most Water problem solution in Python
- Leetcode Container With Most Water problem solution in C