coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 22:38:57 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/jump-game-iv.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"52.6K\", \"totalAcceptedRaw\": 24655, \"totalSubmissionRaw\": 52584, \"acRate\": \"46.9%\"}",
"stats": "{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"52.7K\", \"totalAcceptedRaw\": 24681, \"totalSubmissionRaw\": 52653, \"acRate\": \"46.9%\"}",
"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."