update

leetcode-cn/originData/maximum-xor-of-two-numbers-in-an-array.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个整数数组 <code>nums</code> ，返回<em> </em><code>nums[i] XOR nums[j]</code> 的最大运算结果，其中 <code>0 ≤ i ≤ j < n</code> 。</p>\n\n<p><strong>进阶：</strong>你可以在 <code>O(n)</code> 的时间解决这个问题吗？</p>\n\n<p> </p>\n\n<div class=\"original__bRMd\">\n<div>\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [3,10,5,25,2,8]\n<strong>输出：</strong>28\n<strong>解释：</strong>最大运算结果是 5 XOR 25 = 28.</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [0]\n<strong>输出：</strong>0\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [2,4]\n<strong>输出：</strong>6\n</pre>\n\n<p><strong>示例 4：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [8,10,2]\n<strong>输出：</strong>10\n</pre>\n\n<p><strong>示例 5：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [14,70,53,83,49,91,36,80,92,51,66,70]\n<strong>输出：</strong>127\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 2 * 10<sup>4</sup></code></li>\n\t<li><code>0 <= nums[i] <= 2<sup>31</sup> - 1</code></li>\n</ul>\n</div>\n</div>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 431,
+            "likes": 436,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"36.6K\", \"totalSubmission\": \"58.9K\", \"totalAcceptedRaw\": 36566, \"totalSubmissionRaw\": 58890, \"acRate\": \"62.1%\"}",
+            "stats": "{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"60K\", \"totalAcceptedRaw\": 37199, \"totalSubmissionRaw\": 60002, \"acRate\": \"62.0%\"}",
             "hints": [],
             "solution": null,
             "status": null,