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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/count-all-valid-pickup-and-delivery-options.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1499,
"dislikes": 136,
"likes": 1524,
"dislikes": 138,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "1\n2\n3",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"50.6K\", \"totalSubmission\": \"79.9K\", \"totalAcceptedRaw\": 50599, \"totalSubmissionRaw\": 79875, \"acRate\": \"63.3%\"}",
"stats": "{\"totalAccepted\": \"51.3K\", \"totalSubmission\": \"81K\", \"totalAcceptedRaw\": 51337, \"totalSubmissionRaw\": 81044, \"acRate\": \"63.3%\"}",
"hints": [
"Use the permutation and combination theory to add one (P, D) pair each time until n pairs."
],