<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>Trie - 标签 - zwyyy456&#39;s blog</title>
        <link>https://doit.tellm.eu.org/zh/tags/trie/</link>
        <description>Trie - 标签 - zwyyy456&#39;s blog</description>
        <generator>Hugo -- gohugo.io</generator><language>zh</language><managingEditor>zwyyy456@hotmail.com (zwyyy456)</managingEditor>
            <webMaster>zwyyy456@hotmail.com (zwyyy456)</webMaster><copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright><lastBuildDate>Tue, 30 May 2023 14:22:00 &#43;0800</lastBuildDate><atom:link href="https://doit.tellm.eu.org/zh/tags/trie/" rel="self" type="application/rss+xml" /><item>
    <title>421. 数组中两个数的最大异或值 (Medium)</title>
    <link>https://doit.tellm.eu.org/zh/421.maximum-xor-of-two-numbers-in-an-array/</link>
    <pubDate>Tue, 30 May 2023 14:22:00 &#43;0800</pubDate><author>
                    <name>zwyyy456</name>
                </author><guid>https://doit.tellm.eu.org/zh/421.maximum-xor-of-two-numbers-in-an-array/</guid>
    <description><![CDATA[1 问题描述421. 数组中两个数的最大异或值 (Medium) 给你一个整数数组 nums ，返回 nums[i] XOR nums[j] 的最大 运算结果，其中 0 ≤ i ≤ j &lt; n 。 示例 1： text 输入：nums = [3,10,5,25,2,8] 输]]></description>
</item></channel>
</rss>
