首页 > 代码库 > Leetcode | Container With Most Water
Leetcode | 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.
暴力超时。网上的算法，左右两指针。。。
1 class Solution { 2 public: 3 int maxArea(vector<int> &height) { 4 int i = 0, j = height.size() - 1, water, max = 0; 5 while (i < j) { 6 if (height[i] < height[j]) { 7 water = (j - i) * height[i]; 8 i++; 9 } else {10 water = (j - i) * height[j];11 j--;12 }13 if (water > max) max = water;14 }15 return max;16 }17 };
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。