coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/find-the-maximum-number-of-marked-indices.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"47K\", \"totalAcceptedRaw\": 17735, \"totalSubmissionRaw\": 46990, \"acRate\": \"37.7%\"}",
"stats": "{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"47K\", \"totalAcceptedRaw\": 17742, \"totalSubmissionRaw\": 47001, \"acRate\": \"37.7%\"}",
"hints": [
"Think about how to check that performing k operations is possible.",
"To perform k operations, it’s optimal to use the smallest k elements and the largest k elements and think about how to match them.",