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/count-pairs-with-xor-in-a-range.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 269,
"dislikes": 10,
"likes": 277,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,4,2,7]\n2\n6\n[9,8,4,2,1]\n5\n14",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"9.8K\", \"totalAcceptedRaw\": 4520, \"totalSubmissionRaw\": 9752, \"acRate\": \"46.3%\"}",
"stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 4591, \"totalSubmissionRaw\": 9914, \"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."