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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/minimum-number-of-visited-cells-in-a-grid.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 344,
"likes": 345,
"dislikes": 27,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Jump Game II\", \"titleSlug\": \"jump-game-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Jump Game\", \"titleSlug\": \"jump-game\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -179,7 +179,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 7355, \"totalSubmissionRaw\": 29843, \"acRate\": \"24.6%\"}",
"stats": "{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 7359, \"totalSubmissionRaw\": 29852, \"acRate\": \"24.7%\"}",
"hints": [
"For each cell (i,j), it is critical to find out the minimum number of steps to reach (i,j), denoted dis[i][j], quickly, given the tight constraint.",
"Calculate dis[i][j] going left to right, top to bottom.",