Container With Most Water

joannae_hu

于 2014-09-24 16:03:53 发布

阅读量565

点赞数

分类专栏： LeetCode 文章标签： leetcode 动态规划

本文链接：https://blog.csdn.net/joannae_hu/article/details/39524347

版权

LeetCode 专栏收录该内容

157 篇文章 0 订阅

订阅专栏

-----QUESTION-----

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.

-----SOLUTION-----

class Solution {
public:
    int maxArea(vector<int> &height) {
        if(height.size() ==1) return 0;
        int width;
        int tall;
        result = 0;
        int i = 0;
        int j = height.size()-1;
        while(i<j)
        {
            tall = min(height[i],height[j]);
            width = j-i;
            if(tall*width > result) result = tall*width;
            if(height[i] > height[j]) j--;
            else i++; 
        }
        return result;
        
    }
private:
    int result;
};

以下算法在judge large时time limit exceeded

class Solution {
public:
    int maxArea(vector<int> &height) {
        if(height.size() ==1) return 0;
        int width;
        int tall;
        result = 0;
        for(int i = 1; i< height.size(); i++)
        {
            for(int j = i+1; j<height.size(); j++)
            {
                tall = min(height[i],height[j]);
                width = j-i;
                if(tall*width > result) result = tall*width;
            }
        }
        return result;
    }
private:
    int result;
};