11. Container With Most Water

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

这道题里面,一开始从左右两边开始,这个case下宽度是最大的,那之后出现比它大的情况只有两条边中至少一边更长。一种思路是先从左边开始,如果左边比右边小,那么向左挪一位,继续比较。当左边比右边大的情况下,修正结果。然后从右边开始挪,因为此时左边的边是更大的,只有右边比左边还大才可能比之前的contains更多水。

public int MaxArea(int[] height) {
         int left = 0;
         int right = height.Count()-1;
         int res =Math.Min(height[right],height[left])*(right - left);
         while(left<right)
         {
             res =Math.Max(res,Math.Min(height[right],height[left])*(right - left));
             if(height[left]>= height[right])
             {
                 right--;
             }
             else 
             {
                 left++;
             }
            
         }
         
         return res;
    }

 

posted @ 2016-09-26 00:12  咖啡中不塌缩的方糖  阅读(107)  评论(0编辑  收藏  举报