LeetCode 11. Container With Most Water

最新推荐文章于 2021-09-18 15:34:23 发布

CristinaE

最新推荐文章于 2021-09-18 15:34:23 发布

阅读量167

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/CristinaE/article/details/79809873

版权

LeetCode 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

LeetCode 11. 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 and n is at least 2.

分析

时间很富裕的一道题，本来想先用暴力试试时间的，结果一下就过了……
稍微优化了一下(非最优解)。

代码实现

class Solution {
public:
   int maxArea(vector<int>& height) {
        int maxNum = 0;
        int maxHeightLeft = 0;
        for (int indexFirst = 0; indexFirst < height.size(); indexFirst++)
        {
            if (maxHeightLeft < height[indexFirst])maxHeightLeft = height[indexFirst];
            else continue;
            for (int indexSecond = height.size() - 1; indexSecond > indexFirst; indexSecond--)
            {
                if (height[indexFirst] <= height[indexSecond]) {
                    maxNum = max(maxNum, (indexSecond - indexFirst) * height[indexFirst]);
                    break;
                }
                maxNum = max(maxNum, (indexSecond - indexFirst) * min(height[indexFirst], height[indexSecond]));
            }
        }
        return maxNum;
    }
};