Container_With_Most_Water.cpp

// Source : https://leetcode-cn.com/problems/container-with-most-water/description/
// Number : 11
// Author : HL
// Date   : 2018-09-15
// Kill   : 94.18%

/********************************************************************************** 
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.
 
Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49
**********************************************************************************/

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