mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
58 lines
2.0 KiB
HTML
58 lines
2.0 KiB
HTML
<p>You are given an integer array <code>nums</code> of length <code>n</code>, where <code>nums</code> is a <strong><span data-keyword="permutation">permutation</span></strong> of the numbers in the range <code>[1, n]</code>.</p>
|
|
|
|
<p>A <strong>XOR triplet</strong> is defined as the XOR of three elements <code>nums[i] XOR nums[j] XOR nums[k]</code> where <code>i <= j <= k</code>.</p>
|
|
|
|
<p>Return the number of <strong>unique</strong> XOR triplet values from all possible triplets <code>(i, j, k)</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">nums = [1,2]</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">2</span></p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<p>The possible XOR triplet values are:</p>
|
|
|
|
<ul>
|
|
<li><code>(0, 0, 0) → 1 XOR 1 XOR 1 = 1</code></li>
|
|
<li><code>(0, 0, 1) → 1 XOR 1 XOR 2 = 2</code></li>
|
|
<li><code>(0, 1, 1) → 1 XOR 2 XOR 2 = 1</code></li>
|
|
<li><code>(1, 1, 1) → 2 XOR 2 XOR 2 = 2</code></li>
|
|
</ul>
|
|
|
|
<p>The unique XOR values are <code>{1, 2}</code>, so the output is 2.</p>
|
|
</div>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">nums = [3,1,2]</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">4</span></p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<p>The possible XOR triplet values include:</p>
|
|
|
|
<ul>
|
|
<li><code>(0, 0, 0) → 3 XOR 3 XOR 3 = 3</code></li>
|
|
<li><code>(0, 0, 1) → 3 XOR 3 XOR 1 = 1</code></li>
|
|
<li><code>(0, 0, 2) → 3 XOR 3 XOR 2 = 2</code></li>
|
|
<li><code>(0, 1, 2) → 3 XOR 1 XOR 2 = 0</code></li>
|
|
</ul>
|
|
|
|
<p>The unique XOR values are <code>{0, 1, 2, 3}</code>, so the output is 4.</p>
|
|
</div>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= n == nums.length <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= nums[i] <= n</code></li>
|
|
<li><code>nums</code> is a permutation of integers from <code>1</code> to <code>n</code>.</li>
|
|
</ul>
|