Container With Most Water

最新推荐文章于 2019-11-06 10:22:53 发布

leonordo

最新推荐文章于 2019-11-06 10:22:53 发布

阅读量354

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/guoyilin/article/details/48002975

版权

leetcode 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

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.

思路：暴力法是枚举所有可能的组合，可以用贪心法，每次替换最短ｌｉｎｅ。

#include <algorithm>
#include <limits.h>
class Solution {
public:
    int maxArea(vector<int>& height) {
      int start = 0;
      int end = height.size() - 1;
      int maxV = INT_MIN;
      while(start < end)
      {
          int contain = min(height[end], height[start])*(end - start);//area
          maxV = max(maxV, contain);
          if(height[start] <= height[end])
          {
              start++;
          }
          else{
              end--;
          }
      }
      return maxV;
    }
};