1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1828,
"dislikes": 131,
"likes": 1893,
"dislikes": 138,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Path With Minimum Effort\", \"titleSlug\": \"path-with-minimum-effort\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[0,2],[1,3]]\n[[0,1,2,3,4],[24,23,22,21,5],[12,13,14,15,16],[11,17,18,19,20],[10,9,8,7,6]]",
@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"72.1K\", \"totalSubmission\": \"123.1K\", \"totalAcceptedRaw\": 72080, \"totalSubmissionRaw\": 123115, \"acRate\": \"58.5%\"}",
"stats": "{\"totalAccepted\": \"75.4K\", \"totalSubmission\": \"128.5K\", \"totalAcceptedRaw\": 75375, \"totalSubmissionRaw\": 128465, \"acRate\": \"58.7%\"}",
"hints": [
"Use either Dijkstra's, or binary search for the best time T for which you can reach the end if you only step on squares at most T."
],