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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/count-pairs-with-xor-in-a-range.json
View File

@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 4512, \"totalSubmissionRaw\": 9736, \"acRate\": \"46.3%\"}",
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"9.8K\", \"totalAcceptedRaw\": 4520, \"totalSubmissionRaw\": 9752, \"acRate\": \"46.3%\"}",
"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."