algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 08:50:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新417中Carl题解C++代码里的注释错误

Browse Source
This commit is contained in:
lesleyzhao
2024-06-16 13:27:11 +08:00
parent 70643a80a0
commit 1d206949dd
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0417.太平洋大西洋水流问题.md
View File

@ -178,13 +178,13 @@ public:
// 记录从大西洋出发，可以遍历的节点 // 记录从大西洋出发，可以遍历的节点
vector<vector<bool>> atlantic = vector<vector<bool>>(n, vector<bool>(m, false)); vector<vector<bool>> atlantic = vector<vector<bool>>(n, vector<bool>(m, false));
// 从最上最下行的节点出发，向高处遍历 // 从最左最右列的节点出发，向高处遍历
for (int i = 0; i < n; i++) { for (int i = 0; i < n; i++) {
dfs (heights, pacific, i, 0); // 遍历最左列，接触太平洋 dfs (heights, pacific, i, 0); // 遍历最左列，接触太平洋
dfs (heights, atlantic, i, m - 1); // 遍历最右列，接触大西 dfs (heights, atlantic, i, m - 1); // 遍历最右列，接触大西
} }
// 从最左最右列的节点出发，向高处遍历 // 从最上最下行的节点出发，向高处遍历
for (int j = 0; j < m; j++) { for (int j = 0; j < m; j++) {
dfs (heights, pacific, 0, j); // 遍历最上行，接触太平洋 dfs (heights, pacific, 0, j); // 遍历最上行，接触太平洋
dfs (heights, atlantic, n - 1, j); // 遍历最下行，接触大西洋 dfs (heights, atlantic, n - 1, j); // 遍历最下行，接触大西洋