<jupyter_start><jupyter_text>说明：    给定一个非空数组，a0, a1, a2, ..., an-1，其中0 ≤ ai <2^31。    求ai XOR aj的最大结果，其中 0≤i,j<n。你能在O（n）运行时这样做吗？Example:    Input: [3, 10, 5, 25, 2, 8]    Output: 28    Explanation: The maximum result is 5 ^ 25 = 28.<jupyter_code>class Solution:
    def findMaximumXOR(self, nums) -> int:
        pass
nums_ = [3, 10, 5, 25, 2, 8]
solution = Solution()
solution.findMaximumXOR(nums_)<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.1585081585081585, 'fraction_numerical': 0.07459207459207459, 'mean_word_length': 4.0588235294117645, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 6, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '500623', 'license': 'Apache-2.0', 'n_tokens_mistral': 230, 'n_tokens_neox': 203, 'n_words': 45, 'path': 'not done/421. Maximum XOR of Two Numbers in an Array.ipynb', 'repo_name': 'YuHe0108/Leetcode', 'size': '429'}