Fix 0101.孤岛的总面积.md C++的dfs代码问题 #2960
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
这道题目的意思应该是计算孤岛个数吧，根据题意， 对于 5 6 1 1 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 这个输入，应该输出是1. 但是按照卡哥的代码，输出会是2，问题就出在应该是找到==1的陆地后，继续进行dfs，而不是直接count++ 我这边是只修改dfs的部分，还没修改bfs 的部分
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
这道题目的意思应该是计算孤岛个数吧，根据题意，
对于
5 6
1 1 0 0 0 0
1 1 0 0 0 0
0 0 1 1 0 0
0 0 0 0 0 1
0 0 0 0 0 0
这个输入，应该输出是1.
但是按照卡哥的代码，输出会是2，问题就出在应该是找到grid[i][j]==1的陆地后，继续进行dfs，而不是直接count++ 我这边是只修改dfs的部分，还没修改bfs 的部分