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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1758,
"dislikes": 71,
"likes": 1787,
"dislikes": 72,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Jump Game VII\", \"titleSlug\": \"jump-game-vii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[100,-23,-23,404,100,23,23,23,3,404]\n[7]\n[7,6,9,6,9,6,9,7]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"69.8K\", \"totalSubmission\": \"157.2K\", \"totalAcceptedRaw\": 69789, \"totalSubmissionRaw\": 157154, \"acRate\": \"44.4%\"}",
"stats": "{\"totalAccepted\": \"71K\", \"totalSubmission\": \"159.9K\", \"totalAcceptedRaw\": 70960, \"totalSubmissionRaw\": 159868, \"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."