【LeetCode】C# 11、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 and n is at least 2.

给定一个非负数组，每个数代表一块板子，两个数index的差决定其之间的距离，数的大小代表板子高度，求两块板子围起来的矩形面积。

解题思路：对比左右板子的高度来决定是left板右移还是right 左移来优化运算时间。

public class Solution {    public int MaxArea(int[] height) {        int max = 0;        int left = 0;        int right = height.Length -1;        int temp = 0;        while(left<right){            temp = Math.Min(height[left],height[right]) * (right - left);            if(temp>max) max = temp;            if(height[left]<height[right]){                left++;            }            else right --;        }        return max;    }}