即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

11. Container With Most Water

编程语言 u010150046 18℃ 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 and n is at least 2.

即在左右两边找两条线使其与坐标轴围成的面积最大

int maxArea(vector<int>& height) {
    int left = 0, right = height.size() - 1;
    int res = 0;
    while (left < right){
        res = max(res, (right - left) * min(height[left], height[right]));
        if (height[left] < height[right])left++;
        else right--;
    }
    return res;
}

转载请注明:CodingBlog » 11. Container With Most Water

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情