coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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/find-array-given-subset-sums.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 242,
"dislikes": 18,
"likes": 256,
"dislikes": 19,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Subsets\", \"titleSlug\": \"subsets\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Subsets II\", \"titleSlug\": \"subsets-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Recover the Original Array\", \"titleSlug\": \"recover-the-original-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "3\n[-3,-2,-1,0,0,1,2,3]\n2\n[0,0,0,0]\n4\n[0,0,5,5,4,-1,4,9,9,-1,4,3,4,8,3,8]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 2968, \"totalSubmissionRaw\": 6143, \"acRate\": \"48.3%\"}",
"stats": "{\"totalAccepted\": \"3K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 3031, \"totalSubmissionRaw\": 6262, \"acRate\": \"48.4%\"}",
"hints": [
"What information do the two largest elements tell us?",
"Can we use recursion to check all possible states?"