Re: [閒聊] 每日leetcode
1765. Map of Highest Peak
## 思路
水是0, 相鄰的點最多差1
所以從水開始BFS
## Code
```cpp
class Solution {
public:
vector<vector<int>> highestPeak(vector<vector<int>>& isWater) {
int lenR = isWater.size(), lenC = isWater[0].size();
vector<pair<int, int>> dirs = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
vector<vector<int>> height(lenR, vector<int>(lenC, -1));
queue<pair<int, int>> q;
for (int r=0; r<lenR; ++r) {
for (int c=0; c<lenC; ++c) {
if (isWater[r][c]) {
q.push({r, c});
height[r][c] = 0;
}
}
}
while (!q.empty()) {
auto [r, c] = q.front();
q.pop();
for (auto [dr, dc] : dirs) {
int nextR = r + dr, nextC = c + dc;
if (0 <= nextR && nextR < lenR && 0 <= nextC && nextC < lenC
&& height[nextR][nextC] == -1) {
q.push({nextR, nextC});
height[nextR][nextC] = height[r][c] + 1;
}
}
}
return height;
}
};
```
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 86.48.13.234 (日本)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1737555368.A.748.html
討論串 (同標題文章)
完整討論串 (本文為第 1299 之 1552 篇)：