coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 08:21: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/[no content]maximum-coins-heroes-can-collect.json
View File

@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"734\", \"totalSubmission\": \"1K\", \"totalAcceptedRaw\": 734, \"totalSubmissionRaw\": 1033, \"acRate\": \"71.1%\"}",
"stats": "{\"totalAccepted\": \"736\", \"totalSubmission\": \"1K\", \"totalAcceptedRaw\": 736, \"totalSubmissionRaw\": 1038, \"acRate\": \"70.9%\"}",
"hints": [
"If a hero can defeat the <code>i<sup>th</sup></code> monster, then he defeats all the monsters having a power less than <code>monster[i]</code>.",
"Sort monsters by their powers. Also change the order of the coins array according to this sort.",