1
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
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1821,
"dislikes": 130,
"likes": 1828,
"dislikes": 131,
"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\": \"71.9K\", \"totalSubmission\": \"122.8K\", \"totalAcceptedRaw\": 71886, \"totalSubmissionRaw\": 122796, \"acRate\": \"58.5%\"}",
"stats": "{\"totalAccepted\": \"72.1K\", \"totalSubmission\": \"123.1K\", \"totalAcceptedRaw\": 72080, \"totalSubmissionRaw\": 123115, \"acRate\": \"58.5%\"}",
"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."
],