LeetCode 11. Container With Most Water

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2.

answer:

class Solution {
public:
    int maxArea(vector<int>& height) {
        int length = height.size();
        int x_axis = 0, y_axis = 0;
        int maxValue = 0;
        int i = 0, j = length - 1;
        while(i < j){
            maxValue = max(maxValue, (j - i) * min(height[i],height[j]));
            if(height[i] < height[j]) i ++;
            else if (height[i] >= height[j]) j --;
            
        }
        return maxValue;
    }
};