coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/partition-array-into-two-arrays-to-minimize-sum-difference.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 516,
"dislikes": 31,
"likes": 599,
"dislikes": 39,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Partition Equal Subset Sum\", \"titleSlug\": \"partition-equal-subset-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Split Array With Same Average\", \"titleSlug\": \"split-array-with-same-average\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Tallest Billboard\", \"titleSlug\": \"tallest-billboard\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Last Stone Weight II\", \"titleSlug\": \"last-stone-weight-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Closest Subsequence Sum\", \"titleSlug\": \"closest-subsequence-sum\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[3,9,7,3]\n[-36,36]\n[2,-1,0,4,-2,-9]",
@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5K\", \"totalSubmission\": \"22.4K\", \"totalAcceptedRaw\": 4987, \"totalSubmissionRaw\": 22388, \"acRate\": \"22.3%\"}",
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"24.7K\", \"totalAcceptedRaw\": 5352, \"totalSubmissionRaw\": 24728, \"acRate\": \"21.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?",