mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-21 21:16:45 +08:00
移除零宽空格
This commit is contained in:
@@ -7,7 +7,7 @@
|
||||
"boundTopicId": 3754548,
|
||||
"title": "XOR After Range Multiplication Queries I",
|
||||
"titleSlug": "xor-after-range-multiplication-queries-i",
|
||||
"content": "<p>You are given an integer array <code>nums</code> of length <code>n</code> and a 2D integer array <code>queries</code> of size <code>q</code>, where <code>queries[i] = [l<sub>i</sub>, r<sub>i</sub>, k<sub>i</sub>, v<sub>i</sub>]</code>.</p>\n\n<p>For each query, you must apply the following operations in order:</p>\n\n<ul>\n\t<li>Set <code>idx = l<sub>i</sub></code>.</li>\n\t<li>While <code>idx <= r<sub>i</sub></code>:\n\t<ul>\n\t\t<li>Update: <code>nums[idx] = (nums[idx] * v<sub>i</sub>) % (10<sup>9</sup> + 7)</code></li>\n\t\t<li>Set <code>idx += k<sub>i</sub></code>.</li>\n\t</ul>\n\t</li>\n</ul>\n\n<p>Return the <strong>bitwise XOR</strong> of all elements in <code>nums</code> after processing all queries.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">nums = [1,1,1], queries = [[0,2,1,4]]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">4</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<ul>\n\t<li data-end=\"106\" data-start=\"18\">A single query <code data-end=\"44\" data-start=\"33\">[0, 2, 1, 4]</code> multiplies every element from index 0 through index 2 by 4.</li>\n\t<li data-end=\"157\" data-start=\"109\">The array changes from <code data-end=\"141\" data-start=\"132\">[1, 1, 1]</code> to <code data-end=\"154\" data-start=\"145\">[4, 4, 4]</code>.</li>\n\t<li data-end=\"205\" data-start=\"160\">The XOR of all elements is <code data-end=\"202\" data-start=\"187\">4 ^ 4 ^ 4 = 4</code>.</li>\n</ul>\n</div>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">nums = [2,3,1,5,4], queries = [[1,4,2,3],[0,2,1,2]]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">31</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<ul>\n\t<li data-end=\"350\" data-start=\"230\">The first query <code data-end=\"257\" data-start=\"246\">[1, 4, 2, 3]</code> multiplies the elements at indices 1 and 3 by 3, transforming the array to <code data-end=\"347\" data-start=\"333\">[2, 9, 1, 15, 4]</code>.</li>\n\t<li data-end=\"466\" data-start=\"353\">The second query <code data-end=\"381\" data-start=\"370\">[0, 2, 1, 2]</code> multiplies the elements at indices 0, 1, and 2 by 2, resulting in <code data-end=\"463\" data-start=\"448\">[4, 18, 2, 15, 4]</code>.</li>\n\t<li data-end=\"532\" data-is-last-node=\"\" data-start=\"469\">Finally, the XOR of all elements is <code data-end=\"531\" data-start=\"505\">4 ^ 18 ^ 2 ^ 15 ^ 4 = 31</code>.<strong></strong></li>\n</ul>\n</div>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= n == nums.length <= 10<sup>3</sup></code></li>\n\t<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>\n\t<li><code>1 <= q == queries.length <= 10<sup>3</sup></code></li>\n\t<li><code>queries[i] = [l<sub>i</sub>, r<sub>i</sub>, k<sub>i</sub>, v<sub>i</sub>]</code></li>\n\t<li><code>0 <= l<sub>i</sub> <= r<sub>i</sub> < n</code></li>\n\t<li><code>1 <= k<sub>i</sub> <= n</code></li>\n\t<li><code>1 <= v<sub>i</sub> <= 10<sup>5</sup></code></li>\n</ul>\n",
|
||||
"content": "<p>You are given an integer array <code>nums</code> of length <code>n</code> and a 2D integer array <code>queries</code> of size <code>q</code>, where <code>queries[i] = [l<sub>i</sub>, r<sub>i</sub>, k<sub>i</sub>, v<sub>i</sub>]</code>.</p>\n\n<p>For each query, you must apply the following operations in order:</p>\n\n<ul>\n\t<li>Set <code>idx = l<sub>i</sub></code>.</li>\n\t<li>While <code>idx <= r<sub>i</sub></code>:\n\t<ul>\n\t\t<li>Update: <code>nums[idx] = (nums[idx] * v<sub>i</sub>) % (10<sup>9</sup> + 7)</code></li>\n\t\t<li>Set <code>idx += k<sub>i</sub></code>.</li>\n\t</ul>\n\t</li>\n</ul>\n\n<p>Return the <strong>bitwise XOR</strong> of all elements in <code>nums</code> after processing all queries.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">nums = [1,1,1], queries = [[0,2,1,4]]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">4</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<ul>\n\t<li data-end=\"106\" data-start=\"18\">A single query <code data-end=\"44\" data-start=\"33\">[0, 2, 1, 4]</code> multiplies every element from index 0 through index 2 by 4.</li>\n\t<li data-end=\"157\" data-start=\"109\">The array changes from <code data-end=\"141\" data-start=\"132\">[1, 1, 1]</code> to <code data-end=\"154\" data-start=\"145\">[4, 4, 4]</code>.</li>\n\t<li data-end=\"205\" data-start=\"160\">The XOR of all elements is <code data-end=\"202\" data-start=\"187\">4 ^ 4 ^ 4 = 4</code>.</li>\n</ul>\n</div>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<div class=\"example-block\">\n<p><strong>Input:</strong> <span class=\"example-io\">nums = [2,3,1,5,4], queries = [[1,4,2,3],[0,2,1,2]]</span></p>\n\n<p><strong>Output:</strong> <span class=\"example-io\">31</span></p>\n\n<p><strong>Explanation:</strong></p>\n\n<ul>\n\t<li data-end=\"350\" data-start=\"230\">The first query <code data-end=\"257\" data-start=\"246\">[1, 4, 2, 3]</code> multiplies the elements at indices 1 and 3 by 3, transforming the array to <code data-end=\"347\" data-start=\"333\">[2, 9, 1, 15, 4]</code>.</li>\n\t<li data-end=\"466\" data-start=\"353\">The second query <code data-end=\"381\" data-start=\"370\">[0, 2, 1, 2]</code> multiplies the elements at indices 0, 1, and 2 by 2, resulting in <code data-end=\"463\" data-start=\"448\">[4, 18, 2, 15, 4]</code>.</li>\n\t<li data-end=\"532\" data-is-last-node=\"\" data-start=\"469\">Finally, the XOR of all elements is <code data-end=\"531\" data-start=\"505\">4 ^ 18 ^ 2 ^ 15 ^ 4 = 31</code>.<strong></strong></li>\n</ul>\n</div>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= n == nums.length <= 10<sup>3</sup></code></li>\n\t<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>\n\t<li><code>1 <= q == queries.length <= 10<sup>3</sup></code></li>\n\t<li><code>queries[i] = [l<sub>i</sub>, r<sub>i</sub>, k<sub>i</sub>, v<sub>i</sub>]</code></li>\n\t<li><code>0 <= l<sub>i</sub> <= r<sub>i</sub> < n</code></li>\n\t<li><code>1 <= k<sub>i</sub> <= n</code></li>\n\t<li><code>1 <= v<sub>i</sub> <= 10<sup>5</sup></code></li>\n</ul>\n",
|
||||
"translatedTitle": "区间乘法查询后的异或 I",
|
||||
"translatedContent": "<p>给你一个长度为 <code>n</code> 的整数数组 <code>nums</code> 和一个大小为 <code>q</code> 的二维整数数组 <code>queries</code>，其中 <code>queries[i] = [l<sub>i</sub>, r<sub>i</sub>, k<sub>i</sub>, v<sub>i</sub>]</code>。</p>\n\n<p>对于每个查询，按以下步骤执行操作：</p>\n\n<ul>\n\t<li>设定 <code>idx = l<sub>i</sub></code>。</li>\n\t<li>当 <code>idx <= r<sub>i</sub></code> 时：\n\t<ul>\n\t\t<li>更新：<code>nums[idx] = (nums[idx] * v<sub>i</sub>) % (10<sup>9</sup> + 7)</code></li>\n\t\t<li>将 <code>idx += k<sub>i</sub></code>。</li>\n\t</ul>\n\t</li>\n</ul>\n\n<p>在处理完所有查询后，返回数组 <code>nums</code> 中所有元素的 <strong>按位异或 </strong>结果。</p>\n\n<p> </p>\n\n<p><strong class=\"example\">示例 1：</strong></p>\n\n<div class=\"example-block\">\n<p><strong>输入：</strong> <span class=\"example-io\">nums = [1,1,1], queries = [[0,2,1,4]]</span></p>\n\n<p><strong>输出：</strong> <span class=\"example-io\">4</span></p>\n\n<p><strong>解释：</strong></p>\n\n<ul>\n\t<li>唯一的查询 <code>[0, 2, 1, 4]</code> 将下标 0 到下标 2 的每个元素乘以 4。</li>\n\t<li>数组从 <code>[1, 1, 1]</code> 变为 <code>[4, 4, 4]</code>。</li>\n\t<li>所有元素的异或为 <code>4 ^ 4 ^ 4 = 4</code>。</li>\n</ul>\n</div>\n\n<p><strong class=\"example\">示例 2：</strong></p>\n\n<div class=\"example-block\">\n<p><strong>输入：</strong> <span class=\"example-io\">nums = [2,3,1,5,4], queries = [[1,4,2,3],[0,2,1,2]]</span></p>\n\n<p><strong>输出：</strong> <span class=\"example-io\">31</span></p>\n\n<p><strong>解释：</strong></p>\n\n<ul>\n\t<li>第一个查询 <code>[1, 4, 2, 3]</code> 将下标 1 和 3 的元素乘以 3，数组变为 <code>[2, 9, 1, 15, 4]</code>。</li>\n\t<li>第二个查询 <code>[0, 2, 1, 2]</code> 将下标 0、1 和 2 的元素乘以 2，数组变为 <code>[4, 18, 2, 15, 4]</code>。</li>\n\t<li>所有元素的异或为 <code>4 ^ 18 ^ 2 ^ 15 ^ 4 = 31</code>。</li>\n</ul>\n</div>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 <= n == nums.length <= 10<sup>3</sup></code></li>\n\t<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>\n\t<li><code>1 <= q == queries.length <= 10<sup>3</sup></code></li>\n\t<li><code>queries[i] = [l<sub>i</sub>, r<sub>i</sub>, k<sub>i</sub>, v<sub>i</sub>]</code></li>\n\t<li><code>0 <= l<sub>i</sub> <= r<sub>i</sub> < n</code></li>\n\t<li><code>1 <= k<sub>i</sub> <= n</code></li>\n\t<li><code>1 <= v<sub>i</sub> <= 10<sup>5</sup></code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
|
||||
Reference in New Issue
Block a user