mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 00:11:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"23.2K\", \"totalSubmission\": \"98.3K\", \"totalAcceptedRaw\": 23177, \"totalSubmissionRaw\": 98330, \"acRate\": \"23.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"23.2K\", \"totalSubmission\": \"98.5K\", \"totalAcceptedRaw\": 23205, \"totalSubmissionRaw\": 98450, \"acRate\": \"23.6%\"}",
|
||||
"hints": [
|
||||
"Try to generate all pairs of subsets and check which group provides maximal strength.",
|
||||
"It can also be solved in O(NlogN) by sorting the array and using all positive integers.",
|
||||
|
Reference in New Issue
Block a user