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/out-of-boundary-paths.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1452,
"likes": 1453,
"dislikes": 182,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Knight Probability in Chessboard\", \"titleSlug\": \"knight-probability-in-chessboard\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Execution of All Suffix Instructions Staying in a Grid\", \"titleSlug\": \"execution-of-all-suffix-instructions-staying-in-a-grid\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"62.7K\", \"totalSubmission\": \"156.7K\", \"totalAcceptedRaw\": 62713, \"totalSubmissionRaw\": 156662, \"acRate\": \"40.0%\"}",
"stats": "{\"totalAccepted\": \"62.8K\", \"totalSubmission\": \"156.8K\", \"totalAcceptedRaw\": 62774, \"totalSubmissionRaw\": 156798, \"acRate\": \"40.0%\"}",
"hints": [
"Is traversing every path feasible? There are many possible paths for a small matrix. Try to optimize it.",
"Can we use some space to store the number of paths and update them after every move?",