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

2
leetcode/originData/k-items-with-the-maximum-sum.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"53.2K\", \"totalAcceptedRaw\": 32485, \"totalSubmissionRaw\": 53189, \"acRate\": \"61.1%\"}",
"stats": "{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"53.2K\", \"totalAcceptedRaw\": 32510, \"totalSubmissionRaw\": 53228, \"acRate\": \"61.1%\"}",
"hints": [
"It is always optimal to take items with the number 1 written on them as much as possible.",
"If k > numOnes, after taking all items with the number 1, it is always optimal to take items with the number 0 written on them as much as possible.",