Re: [閒聊] 每日leetcode

看板Marginalman作者sixB (6B)時間1年前 (2024/08/13 01:49)推噓-1(2推 3噓 9→)

留言14則, 4人參與討論串703/1549 (看更多)

a十個零叔叔說刷題沒救了可是我也不知道我還能幹嘛QQ 要轉什麼方向發展比較好啊真的要學餐飲了嗎 703. 今天這題就pq 沒想清楚倒過來放就好想說要random access 所以用vector做二分搜插入不放扣出來醜人惹：（ 1568. 也把昨天那題寫完了突然就順順的跑完縫縫補補分3個case 不過solution好像也差不多昨天一直沒想清楚又一直改以為每格都掃一次會很慢 constraint其實也才30*30 簡單來說就是我太笨 class Solution { public: int minDays(vector<vector<int>>& grid) { int n = grid.size(), m = grid[0].size(); bool flag = false; vector<vector<int>> check0 = grid; int land = 0; for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ // 1 cut if(grid[i][j] == 1) { cut(check0, grid, i, j); flag = true; break; } } if(flag) break; } for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ if(check0[i][j] == 1) { return 0; } if(grid[i][j] == 1) land++; } } if(land <= 2) return land; for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ // 1 cut vector<vector<int>> check = grid; if(grid[i][j] == 1){ grid[i][j] = 0; check[i][j] = 0; if(i < n-1 and grid[i+1][j] == 1) cut(check, grid, i+1, j); else if(i > 0 and grid[i-1][j] == 1) cut(check, grid, i-1, j); else if(j < m-1 and grid[i][j+1] == 1) cut(check, grid, i, j+1); else if(j > 0 and grid[i][j-1] == 1) cut(check, grid, i, j-1); grid[i][j] = 1; if((i < n-1 and check[i+1][j]) or\ (i > 0 and check[i-1][j]) or\ (j < m-1 and check[i][j+1]) or\ (j > 0 and check[i][j-1])){ cout << "COOL\n"; cout << i << " " << j << '\n'; return 1; } } } } return 2; } void cut(vector<vector<int>>& check, vector<vector<int>>& grid, int i, int j){ if(i < 0 or i >= grid.size() or j < 0 or j >= grid[0].size()) return; if(check[i][j] == 0) return; check[i][j] = 0; cut(check, grid, i-1, j); cut(check, grid, i+1, j); cut(check, grid, i, j-1); cut(check, grid, i, j+1); } }; -- ※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 123.205.121.194 (臺灣) ※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1723484997.A.863.html

→

sixB

08/13 01:51, 1年前 , 1^F

08/13 01:51, 1^F

→

sixB

08/13 01:51, 1年前 , 2^F

08/13 01:51, 2^F

噓

a000000000

08/13 02:06, 1年前 , 3^F

08/13 02:06, 3^F