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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]number-of-ways-to-reach-destination-in-the-grid.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 10,
"likes": 12,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"588\", \"totalSubmission\": \"767\", \"totalAcceptedRaw\": 588, \"totalSubmissionRaw\": 767, \"acRate\": \"76.7%\"}",
"stats": "{\"totalAccepted\": \"681\", \"totalSubmission\": \"954\", \"totalAcceptedRaw\": 681, \"totalSubmissionRaw\": 954, \"acRate\": \"71.4%\"}",
"hints": [
"We are asked to count the number of sequences of length <code>k + 1</code> that start from <code>(x<sub>s</sub>, y<sub>s</sub>)</code> and end with <code>(x<sub>d</sub>, y<sub>d</sub>)</code>. i.e., <code>(x<sub>s</sub>, y<sub>s</sub>), (x<sub>1</sub>, y<sub>1</sub>), ..., (x<sub>k - 1</sub>, y<sub>k - 1</sub>), (x<sub>d</sub>, y<sub>d</sub>)</code>.",
"The key point is to see <code>x</code> and <code>y</code> separately.",