coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/count-all-valid-pickup-and-delivery-options.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 2964,
"likes": 2965,
"dislikes": 218,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"117.2K\", \"totalSubmission\": \"179.2K\", \"totalAcceptedRaw\": 117214, \"totalSubmissionRaw\": 179233, \"acRate\": \"65.4%\"}",
"stats": "{\"totalAccepted\": \"117.2K\", \"totalSubmission\": \"179.2K\", \"totalAcceptedRaw\": 117222, \"totalSubmissionRaw\": 179244, \"acRate\": \"65.4%\"}",
"hints": [
"Use the permutation and combination theory to add one (P, D) pair each time until n pairs."
],