Leetcode--Container with the most water

Source: Internet
Author: User


Given n non-negative integers a1, A2, ..., an, where each represents a point at coordinate (I, AI). n vertical lines is drawn such, the and the other endpoints of line I am at (i, AI) and (i, 0). Find lines, which together with X-axis forms a container, such that the container contains the most water.

Note:you may not slant the container.

Test instructions

Find I,j in the given array a[i] to make ABS (j-i) *min (a[i],a[j]) values maximum


Just beginning to use the double loop, O (n^2), time-out, instead of greedy thinking, only try to have a better solution at a time, finally after the end of the traversal, the complexity O (n);
The specific steps set I at the beginning of the sequence, J at the end of the sequence, if A[i]

int maxArea(intint heightSize) {    int max=0,f,a,i=0,j=heightSize-1;    while(i<j)    {        f=height[i]1:0;        if(f)        {            a=(j-i)*height[i];            i++;        }        else        {            a=(j-i)*height[j];            j--;        }        if(a>max)        {            max=a;        }    }    return max;}

Leetcode--Container with the most water

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.