1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1107,
"likes": 1196,
"dislikes": 32,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"48.6K\", \"totalSubmission\": \"77.9K\", \"totalAcceptedRaw\": 48608, \"totalSubmissionRaw\": 77941, \"acRate\": \"62.4%\"}",
"stats": "{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"83.4K\", \"totalAcceptedRaw\": 52327, \"totalSubmissionRaw\": 83447, \"acRate\": \"62.7%\"}",
"hints": [
"Can you model this problem as a graph problem? Create n * m + 1 nodes where n * m nodes represents each cell of the map and one extra node to represent the exterior of the map.",
"In the map add edges between neighbors on land cells. And add edges between the exterior and land nodes which are in the boundary.\r\nReturn as answer the number of nodes that are not reachable from the exterior node."