huangge1199/leet-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

1803:统计异或值在范围内的数对有多少

Browse Source
This commit is contained in:
huangge1199 2021-06-02 16:38:02 +08:00
parent c51e9c0b03
commit 7efb0980b6
1 changed files with 5 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/main/java/leetcode/editor/cn/CountPairsWithXorInARange.java
View File

@ -57,6 +57,7 @@ public class CountPairsWithXorInARange {
//leetcode submit region begin(Prohibit modification and deletion) //leetcode submit region begin(Prohibit modification and deletion)
class Solution { class Solution {
public int countPairs(int[] nums, int low, int high) { public int countPairs(int[] nums, int low, int high) {
// xors[index] ： nums[0]^数组中其他值=index
int[] xors = new int[32768]; int[] xors = new int[32768];
int count = 0; int count = 0;
for (int i = 1; i < nums.length; i++) { for (int i = 1; i < nums.length; i++) {
@ -66,6 +67,10 @@ public class CountPairsWithXorInARange {
} }
xors[num]++; xors[num]++;
} }
// xor ^ j = index = nums[0] ^ 数组中其他值
// xor ^ j = nums[0] ^ 数组中其他值
// xor ^ j ^ (nums[0] ^ 数组中其他值 ^ j) = nums[0] ^ 数组中其他值 ^ (nums[0] ^ 数组中其他值 ^ j)
// nums[i] ^ 数组中其他值 = j
for (int i = 1; i < nums.length; i++) { for (int i = 1; i < nums.length; i++) {
int xor = nums[0] ^ nums[i]; int xor = nums[0] ^ nums[i];
xors[xor]--; xors[xor]--;