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/maximum-and-sum-of-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 214,
"dislikes": 10,
"likes": 221,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum XOR Sum of Two Arrays\", \"titleSlug\": \"minimum-xor-sum-of-two-arrays\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,4,5,6]\n3\n[1,3,10,4,7,1]\n9",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"11.9K\", \"totalAcceptedRaw\": 5117, \"totalSubmissionRaw\": 11921, \"acRate\": \"42.9%\"}",
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"12.3K\", \"totalAcceptedRaw\": 5291, \"totalSubmissionRaw\": 12261, \"acRate\": \"43.2%\"}",
"hints": [
"Can you think of a dynamic programming solution to this problem?",
"Can you use a bitmask to represent the state of the slots?"