coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/minimum-obstacle-removal-to-reach-corner.json
View File

@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 20332, \"totalSubmissionRaw\": 39183, \"acRate\": \"51.9%\"}",
"stats": "{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 20338, \"totalSubmissionRaw\": 39193, \"acRate\": \"51.9%\"}",
"hints": [
"Model the grid as a graph where cells are nodes and edges are between adjacent cells. Edges to cells with obstacles have a cost of 1 and all other edges have a cost of 0.",
"Could you use 0-1 Breadth-First Search or Dijkstra’s algorithm?"