[leetcode] Container With Most Water

Container With Most Water

第一次超时：

#include<iostream>#include<vector>using namespace std;class Solution {public:    int maxArea(vector<int> &height) {    int len=height.size();    int tempArea=0;    int maxArea=0;    for (int i = 0; i < len; ++i)    {    for (int j = len-1; j >=i; j--)    {    int gao=height[i]>height[j]? height[j]:height[i];    tempArea=(j-i)*gao;    if (tempArea>maxArea)    {    maxArea=tempArea;    }    }        }    return maxArea;    }};

Status: 

Time Limit Exceeded

第二次

class Solution {public:    int maxArea(vector<int> &height) {    int left=0;    int right=height.size()-1;    int tempArea=0;    int maxArea=0;    while(left<right){    int minHeight=height[left]>height[right]?height[right]:height[left];    tempArea=minHeight*(right-left);    maxArea=tempArea>maxArea?tempArea:maxArea;    if (height[left]<height[right])    left++;    else    right--;    }    return maxArea;    }};

Status: 

Accepted