#11 LeetCode——Container With Most Water

能装最多水的容器

题目意思是指一个数组a1、a2、a3…每一个数字的大小表示高度，角标表示x轴上的位置即第一个数a1表示的是x轴1处有一个高度为a1的板子，然后求这么多板子，哪两块板子之间可以存储最多的水。

---

java代码如下

public class Solution {    public int maxArea(int[] height) {        int len = height.length;        int maxWater = 0;        int water, lower;        int left = 0, right = len - 1;        if(len == 1 || len == 0)        {            return maxWater;        }        while(left  < right)        {            if(height[right] > height[left])            {                lower = height[left];                water = (right - left) * lower;                left++;            }            else            {                lower = height[right];                water = (right - left) * lower;                right--;            }            if(water > maxWater)            {                maxWater = water;            }        }        return maxWater;    }}

---