coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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/count-pairs-with-xor-in-a-range.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"5.7K\", \"totalAcceptedRaw\": 2324, \"totalSubmissionRaw\": 5671, \"acRate\": \"41.0%\"}",
"stats": "{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"5.7K\", \"totalAcceptedRaw\": 2325, \"totalSubmissionRaw\": 5675, \"acRate\": \"41.0%\"}",
"hints": [
"Let's note that we can count all pairs with XOR ≤ K, so the answer would be to subtract the number of pairs withs XOR < low from the number of pairs with XOR ≤ high.",
"For each value, find out the number of values when you XOR it with the result is ≤ K using a trie."