-
Notifications
You must be signed in to change notification settings - Fork 0
/
11.cpp
82 lines (76 loc) · 1.75 KB
/
11.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <iostream>
#include <cstring>
#include <vector>
using namespace std;
class Solution
{
public:
int maxArea(vector<int> &height)
{
int max=0;
int i=0;
int j=height.size()-1;
int h=0;
while(i<j)
{
if(height[i]<height[j])
{
if(height[i]*(j-i)>max)
max=height[i]*(j-i);
i++;
}
else
{
if(height[j]*(j-i)>max)
max=height[j]*(j-i);
j--;
}
}
return max;
}
};
class Solution1
{
public:
int maxArea(vector<int> &height)
{
int minHeight[height.size()][height.size()];
memset(minHeight,0,sizeof(minHeight));
int max=0;
for(int i=0; i<height.size()-1; i++)
{
if(height[i+1]<=height[i])
minHeight[i][i+1]=height[i+1];
else
minHeight[i][i+1]=height[i];
if(minHeight[i][i+1]>=max)
max=minHeight[i][i+1];
}
for(int i=2; i<height.size()-1; i++)
{
for(int j=0; j<height.size()-i; j++)
{
if(height[j+i]<=minHeight[j][j+i-1])
minHeight[j][j+i]=height[j+i];
else
minHeight[j][i+j]=minHeight[j][j+i-1];
if(minHeight[j][i]*i>=max)
max=minHeight[j][i]*i;
}
}
return max;
}
};
int main()
{
Solution s;
vector<int> height;
height.push_back(1);
height.push_back(3);
height.push_back(2);
height.push_back(4);
height.push_back(1);
height.push_back(2);
cout<<s.maxArea(height)<<endl;
return 0;
}