coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/jump-game-iv.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1756,
"likes": 1758,
"dislikes": 71,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Jump Game VII\", \"titleSlug\": \"jump-game-vii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"69.7K\", \"totalSubmission\": \"156.9K\", \"totalAcceptedRaw\": 69696, \"totalSubmissionRaw\": 156933, \"acRate\": \"44.4%\"}",
"stats": "{\"totalAccepted\": \"69.8K\", \"totalSubmission\": \"157.2K\", \"totalAcceptedRaw\": 69789, \"totalSubmissionRaw\": 157154, \"acRate\": \"44.4%\"}",
"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."