Container With Most Water

来源：Leetcode

原帖：http://oj.leetcode.com/problems/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.
Solution: From both sides to the center. 2 pointers.

代码：

 class Solution {  
 public:  
   int maxArea(vector<int> &height) {  
     int result = 0;  
     int l = 0, r = height.size() - 1;    
     while (l < r) {  
       result = max(result, (r - l) * min(height[l], height[r]));  
       height[l] <= height[r] ? l++ : r--;  
     }  
     return result;  
   }  
 };