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/partition-array-into-two-arrays-to-minimize-sum-difference.json
View File

@@ -179,7 +179,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"20K\", \"totalSubmission\": \"102.1K\", \"totalAcceptedRaw\": 20047, \"totalSubmissionRaw\": 102145, \"acRate\": \"19.6%\"}",
"stats": "{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"102.2K\", \"totalAcceptedRaw\": 20059, \"totalSubmissionRaw\": 102169, \"acRate\": \"19.6%\"}",
"hints": [
"The target sum for the two partitions is sum(nums) / 2.",
"Could you reduce the time complexity if you arbitrarily divide nums into two halves (two arrays)? Meet-in-the-Middle?",