coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/minimum-xor-sum-of-two-arrays.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"5.6K\", \"totalAcceptedRaw\": 2528, \"totalSubmissionRaw\": 5595, \"acRate\": \"45.2%\"}",
"stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"5.6K\", \"totalAcceptedRaw\": 2539, \"totalSubmissionRaw\": 5611, \"acRate\": \"45.3%\"}",
"hints": [
"Since n <= 14, we can consider every subset of nums2.",
"We can represent every subset of nums2 using bitmasks."