maximum-xor-with-an-element-from-array

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array <code>nums</code> consisting of non-negative integers. You are also given a <code>queries</code> array, where <code>queries[i] = [xi, mi]</code>.

The answer to the <code>ith</code> query is the maximum bitwise <code>XOR</code> value of <code>xi</code> and any element of <code>nums</code> that does not exceed <code>mi</code>. In other words, the answer is <code>max(nums[j] XOR xi)</code> for all <code>j</code> such that <code>nums[j] &lt;= mi</code>. If all elements in <code>nums</code> are larger than <code>mi</code>, then the answer is <code>-1</code>.

Return an integer array <code>answer</code> where <code>answer.length == queries.length</code> and <code>answer[i]</code> is the answer to the <code>ith</code> query.

&nbsp;
Example 1:

<pre>
Input: nums = [0,1,2,3,4], queries = [[3,1],[1,3],[5,6]]
Output: [3,3,7]
Explanation:
1) 0 and 1 are the only two integers not greater than 1. 0 XOR 3 = 3 and 1 XOR 3 = 2. The larger of the two is 3.
2) 1 XOR 2 = 3.
3) 5 XOR 2 = 7.
</pre>

Example 2:

<pre>
Input: nums = [5,2,4,6,6,3], queries = [[12,4],[8,1],[6,3]]
Output: [15,-1,5]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length, queries.length &lt;= 105</code></li>
	<li><code>queries[i].length == 2</code></li>
	<li><code>0 &lt;= nums[j], xi, mi &lt;= 109</code></li>
</ul>

maximizeXor

Maximum XOR With an Element From Array

Maximum XOR of Two Numbers in an Array

maximum-xor-of-two-numbers-in-an-array

数组中两个数的最大异或值

Maximum Genetic Difference Query

maximum-genetic-difference-query

查询最大基因差

Minimize XOR

minimize-xor

最小异或

Maximum Strong Pair XOR I

maximum-strong-pair-xor-i

找出强数对的最大异或值 I

Maximum Strong Pair XOR II

maximum-strong-pair-xor-ii

找出强数对的最大异或值 II

Bit Manipulation

Trie

Array

给你一个由非负整数组成的数组 <code>nums</code> 。另有一个查询数组 <code>queries</code> ，其中 <code>queries[i] = [xi, mi]</code> 。

第 <code>i</code> 个查询的答案是 <code>xi</code> 和任何 <code>nums</code> 数组中不超过 <code>mi</code> 的元素按位异或（<code>XOR</code>）得到的最大值。换句话说，答案是 <code>max(nums[j] XOR xi)</code> ，其中所有 <code>j</code> 均满足 <code>nums[j] &lt;= mi</code> 。如果 <code>nums</code> 中的所有元素都大于 <code>mi</code>，最终答案就是 <code>-1</code> 。

返回一个整数数组 <code>answer</code> 作为查询的答案，其中 <code>answer.length == queries.length</code> 且 <code>answer[i]</code> 是第 <code>i</code> 个查询的答案。

 

示例 1：

<pre>输入：nums = [0,1,2,3,4], queries = [[3,1],[1,3],[5,6]]
输出：[3,3,7]
解释：
1) 0 和 1 是仅有的两个不超过 1 的整数。0 XOR 3 = 3 而 1 XOR 3 = 2 。二者中的更大值是 3 。
2) 1 XOR 2 = 3.
3) 5 XOR 2 = 7.
</pre>

示例 2：

<pre>输入：nums = [5,2,4,6,6,3], queries = [[12,4],[8,1],[6,3]]
输出：[15,-1,5]
</pre>

 

提示：

<ul>
	<li><code>1 &lt;= nums.length, queries.length &lt;= 105</code></li>
	<li><code>queries[i].length == 2</code></li>
	<li><code>0 &lt;= nums[j], xi, mi &lt;= 109</code></li>
</ul>