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/count-all-valid-pickup-and-delivery-options.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1497,
"likes": 1499,
"dislikes": 136,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"50.5K\", \"totalSubmission\": \"79.8K\", \"totalAcceptedRaw\": 50522, \"totalSubmissionRaw\": 79754, \"acRate\": \"63.3%\"}",
"stats": "{\"totalAccepted\": \"50.6K\", \"totalSubmission\": \"79.9K\", \"totalAcceptedRaw\": 50599, \"totalSubmissionRaw\": 79875, \"acRate\": \"63.3%\"}",
"hints": [
"Use the permutation and combination theory to add one (P, D) pair each time until n pairs."
],