coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-10 09:51:42 +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/[no content]maximum-price-to-fill-a-bag.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 32,
"dislikes": 5,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[50,1],[10,8]]\n5\n[[100,30]]\n50",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"1.6K\", \"totalAcceptedRaw\": 1069, \"totalSubmissionRaw\": 1622, \"acRate\": \"65.9%\"}",
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"1.6K\", \"totalAcceptedRaw\": 1071, \"totalSubmissionRaw\": 1625, \"acRate\": \"65.9%\"}",
"hints": [
"If the total weight of the items is less than the capacity, then it is impossible to fill a bag.",
"The intended solution greedily chooses items to fill a bag.",