<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 Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        class Node:
            def __init__(self):
                self.links=[None]*2
            def containsKey(self,K):
                return self.links[K]!=None
            def putKey(self,K,newNode):
                self.links[int(K)]=newNode
            def getNext(self,K):
                return self.links[K]
        def insert(num,root):
            node=root
            for i in range(31,-1,-1):
                bit=(num>>i)&1
                if node.containsKey(bit)==False:
                    node.putKey(bit,Node())
                node=node.getNext(bit)
        def searchForMaxXOR(num):
            ab=0
            two=2**31
            node=root
            for i in range(31,-1,-1):
                bit=(num>>i)&1
                if node.containsKey(1-bit):
                    ab=ab+two
                    node=node.getNext(1-bit)
                else:
                    node=node.getNext(bit)
                two=two//2
            return ab
        root=Node()
        mele=max(nums)
        for i in range(len(nums)):
            insert(nums[i],root)
        m=0
        for i in range(len(nums)):
            m=max(m,searchForMaxXOR(nums[i]))
        return m
            
        
            
            
        
436509