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
class Solution {
public:
int maxArea(vector<int>& height) {
int left = 0, right = height.size()-1, area = 0, temp;
while(left < right){
temp = min(height[left], height[right]);
area = max(area, temp * (right - left));
if(height[left] < height[right])
left++;
else
right--;
}
return area;
}
};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#