Container With Most Water

最新推荐文章于 2024-08-28 08:50:09 发布

原创最新推荐文章于 2024-08-28 08:50:09 发布 · 619 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode记录专栏收录该内容

79 篇文章

订阅专栏

本文介绍了一个寻找两个垂直线以形成能容纳最多水的容器的算法。该算法通过遍历所有可能的组合来确定最大的面积，并确保容器不能倾斜。具体实现采用双层循环，通过比较不同组合来找出最大值。

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

class Solution {
public:
    int maxArea(vector<int> &height) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int n = height.size();
        if (n < 2) {
           return 0;
        }
        int max_area = 0;
        int max_height = 0;
        int min = 0;
        int area = 0;
        for (int k = 1; k < n; ++k) {
            for (int i = 0; i < n - k; ++i) {
                min = height[i] < height[i+k] ? height[i] : height[i+k];
                max_height = max_height > min ? max_height : min;
            }
            area = max_height * k;
            max_area = max_area > area ? max_area : area;
            max_height = 0;
        }
        return max_area;
    }
};