Re: [閒聊] 每日leetcode已回收

看板Marginalman作者oinishere (是oin捏)時間1年前 (2024/04/12 11:10)推噓5(5推 0噓 6→)

留言11則, 6人參與討論串113/1548 (看更多)

這題我是用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 --) { paper2.push_back(paper[i]); int tall = 0; int talli = 0; if(paper2.size() > 1 && height[paper2[0]] <= height[paper2[paper2.si ze()-1]]) { //cout << "???" ; tall = min(height[paper2[0]] , height[paper2[paper2.size()-1]] ) ; talli = paper2[paper2.size()-1]; for(int j = paper2[0] ; j > paper2[paper2.size()-1] ; j --) { water += tall - height[j]; //cout << tall << " - " << height[j] << " (" << j << endl; } paper2.clear(); paper2.push_back(talli); } } return water; } }; -- ※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 1.162.47.173 (臺灣) ※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1712891409.A.F87.html

→

wwndbk

04/12 11:11, 1年前 , 1^F

04/12 11:11, 1^F

推

wu10200512

04/12 11:11, 1年前 , 2^F

04/12 11:11, 2^F

→

oinishere

04/12 11:12, 1年前 , 3^F

04/12 11:12, 3^F