关闭

leetcode Container With Most Water

687人阅读 评论(0) 收藏 举报
分类:

Container With Most Water

 Total Accepted: 2685 Total Submissions: 9008My Submissions

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.


This problem is different from largest rectangle in histogram. It's just a line instead of a histogram. So there is no water. 

class Solution {
 public:
  int maxArea(vector<int> &height) {
    int size = height.size(), l = 0, r = size - 1, res = 0;
    if (size == 0)
      return 0;
    while (l < r) {
      if (res < (r - l)*min(height[l],height[r]))
        res = (r - l)*min(height[l],height[r]);
      if (height[l] <= height[r])
        ++l;
      else
        --r;
    } 
    return res;
  }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:276802次
    • 积分:4646
    • 等级:
    • 排名:第6532名
    • 原创:152篇
    • 转载:233篇
    • 译文:0篇
    • 评论:6条
    文章分类
    最新评论