coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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/closest-subsequence-sum.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 428,
"dislikes": 56,
"likes": 438,
"dislikes": 58,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimize the Difference Between Target and Chosen Elements\", \"titleSlug\": \"minimize-the-difference-between-target-and-chosen-elements\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Partition Array Into Two Arrays to Minimize Sum Difference\", \"titleSlug\": \"partition-array-into-two-arrays-to-minimize-sum-difference\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[5,-7,3,5]\n6\n[7,-9,15,-2]\n-5\n[1,2,3]\n-7",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 8372, \"totalSubmissionRaw\": 23021, \"acRate\": \"36.4%\"}",
"stats": "{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"23.7K\", \"totalAcceptedRaw\": 8611, \"totalSubmissionRaw\": 23658, \"acRate\": \"36.4%\"}",
"hints": [
"The naive solution is to check all possible subsequences. This works in O(2^n).",
"Divide the array into two parts of nearly is equal size.",