這題我是用stack做
一樣是找兩邊最高的 讓他們裝水
然後要兩個stack
不然會有沒裝到水的地方
捏
class Solution {
public:
int trap(vector<int>& height)
{
int water = 0;
int len = height.size();
vector<int> paper;
vector<int> paper2;
for(int i = 0 ; i < len ; i ++)
{
paper.push_back(i);
int tall = 0;
int talli = 0;
if(paper.size() > 1 && height[paper[0]] <= height[paper[paper.size()
-1]])
{
tall = min(height[paper[0]] , height[paper[paper.size()-1]] );
talli = i;
for(int j = paper[0]+1 ; j < paper[paper.size()-1] ; j ++)
{
water += tall - height[j];
//cout << tall << " - " << height[j] << " (" << j << endl;
}
paper.clear();
paper.push_back(i);
}
}
for(int i = paper.size()-1 ; i >= 0 ; i