11. Container With Most Water

标签：11 container int maxS Water Most thisS Container ai

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.

 

class Solution {     public int maxArea(int[] a) {        int i = 0;        int j = a.length - 1;        int maxS = 0;        int thisS = 0;        while (i != j) {             thisS = (j - i) * Math.min(a[i], a[j]); //面积等于底*高            maxS = thisS > maxS ? thisS : maxS;            if (a[i] > a[j]) //寻找有无更高的柱子               j--;           else                i++;        }                return maxS;     } }

标签：11,container,int,maxS,Water,Most,thisS,Container,ai
From： https://www.cnblogs.com/MarkLeeBYR/p/16847461.html