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/sum-of-all-subset-xor-totals.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 707,
"dislikes": 74,
"likes": 736,
"dislikes": 78,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,3]\n[5,1,6]\n[3,4,5,6,7,8]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"31.1K\", \"totalSubmission\": \"39.6K\", \"totalAcceptedRaw\": 31131, \"totalSubmissionRaw\": 39585, \"acRate\": \"78.6%\"}",
"stats": "{\"totalAccepted\": \"32.3K\", \"totalSubmission\": \"41.2K\", \"totalAcceptedRaw\": 32347, \"totalSubmissionRaw\": 41152, \"acRate\": \"78.6%\"}",
"hints": [
"Is there a way to iterate through all the subsets of the array?",
"Can we use recursion to efficiently iterate through all the subsets?"