coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +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/jump-game-iv.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"137.9K\", \"totalSubmission\": \"296.8K\", \"totalAcceptedRaw\": 137900, \"totalSubmissionRaw\": 296825, \"acRate\": \"46.5%\"}",
"stats": "{\"totalAccepted\": \"137.9K\", \"totalSubmission\": \"296.9K\", \"totalAcceptedRaw\": 137915, \"totalSubmissionRaw\": 296858, \"acRate\": \"46.5%\"}",
"hints": [
"Build a graph of n nodes where nodes are the indices of the array and edges for node i are nodes i+1, i-1, j where arr[i] == arr[j].",
"Start bfs from node 0 and keep distance. The answer is the distance when you reach node n-1."