mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
50 lines
2.1 KiB
HTML
50 lines
2.1 KiB
HTML
|
<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>, and an integer <code>k</code>.</p>
|
||
|
|
|
||
|
|
<p>The <strong>K-or</strong> of <code>nums</code> is a non-negative integer that satisfies the following:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>The <code>i<sup>th</sup></code> bit is set in the K-or <strong>if and only if</strong> there are at least <code>k</code> elements of nums in which bit <code>i</code> is set.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p>Return <em>the <strong> K-or</strong> of</em> <code>nums</code>.</p>
|
||
|
|
|
||
|
|
<p><strong>Note</strong> that a bit <code>i</code> is set in <code>x</code> if <code>(2<sup>i</sup> AND x) == 2<sup>i</sup></code>, where <code>AND</code> is the bitwise <code>AND</code> operator.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [7,12,9,8,9,15], k = 4
|
||
|
|
<strong>Output:</strong> 9
|
||
|
|
<strong>Explanation:</strong> Bit 0 is set at nums[0], nums[2], nums[4], and nums[5].
|
||
|
|
Bit 1 is set at nums[0], and nums[5].
|
||
|
|
Bit 2 is set at nums[0], nums[1], and nums[5].
|
||
|
|
Bit 3 is set at nums[1], nums[2], nums[3], nums[4], and nums[5].
|
||
|
|
Only bits 0 and 3 are set in at least k elements of the array, and bits i >= 4 are not set in any of the array's elements. Hence, the answer is 2^0 + 2^3 = 9.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [2,12,1,11,4,5], k = 6
|
||
|
|
<strong>Output:</strong> 0
|
||
|
|
<strong>Explanation:</strong> Since k == 6 == nums.length, the 6-or of the array is equal to the bitwise AND of all its elements. Hence, the answer is 2 AND 12 AND 1 AND 11 AND 4 AND 5 = 0.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 3:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [10,8,5,9,11,6,8], k = 1
|
||
|
|
<strong>Output:</strong> 15
|
||
|
|
<strong>Explanation:</strong> Since k == 1, the 1-or of the array is equal to the bitwise OR of all its elements. Hence, the answer is 10 OR 8 OR 5 OR 9 OR 11 OR 6 OR 8 = 15.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= nums.length <= 50</code></li>
|
||
|
|
<li><code>0 <= nums[i] < 2<sup>31</sup></code></li>
|
||
|
|
<li><code>1 <= k <= nums.length</code></li>
|
||
|
|
</ul>
|