[week 5][Leetcode] Container With Most Water

• Question:

Given n non-negative integers a₁, a₂, ...,a_n, where each represents a point at coordinate (i,a_i). n vertical lines are drawn such that the two endpoints of linei is at (i,a_i) 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. 

• Analysis:
• Code:

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