<p>Given an integer array <code>nums</code>, return <em>the maximum result of </em><code>nums[i] XOR nums[j]</code>, where <code>0 &lt;= i &lt;= j &lt; n</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,10,5,25,2,8]
<strong>Output:</strong> 28
<strong>Explanation:</strong> The maximum result is 5 XOR 25 = 28.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [14,70,53,83,49,91,36,80,92,51,66,70]
<strong>Output:</strong> 127
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 10<sup>5</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 2<sup>31</sup> - 1</code></li>
</ul>

class Node:
    def __init__(self):
        self.link=[None,None]
    def put(self,bit,node):
        self.link[bit]=node
    def get(self,bit):
        return self.link[bit]
    def contain(self,bit):
        return self.link[bit] is not None
    
class Trie:
    def __init__(self):
        self.root=Node()
    def insert(self,n):
        node=self.root
        for i in range(31,-1,-1):
            bit=n>>i & 1
            if not node.contain(bit):
                node.put(bit,Node())
            node=node.get(bit)
    def maxxor(self,n):
        node=self.root
        maxi=0
        for i in range(31,-1,-1):
            bit=(n>>i) & 1
            if node.contain(1-bit):
                maxi|=(1<<i)
                node=node.get(1-bit)
            else:
                node=node.get(bit)
        return maxi

class Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        T=Trie()
        for i in nums:
            T.insert(i)
        maxi=0
        for i in nums:
            maxi=max(maxi,T.maxxor(i))
        return maxi
390853