1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-12 17:05:15 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2025-09-25 00:20:19 +08:00
parent 9f09df9544
commit 440092a4c3
56 changed files with 15360 additions and 9973 deletions

View File

@@ -0,0 +1,52 @@
<p>给你一个整数数组 <code>nums</code></p>
<p>返回数组中所有&nbsp;<strong>偶数&nbsp;</strong>的按位 <strong></strong> 运算结果。</p>
<p>如果 <code>nums</code> 中没有偶数,返回 0。</p>
<p>&nbsp;</p>
<p><strong class="example">示例 1</strong></p>
<div class="example-block">
<p><strong>输入:</strong> <span class="example-io">nums = [1,2,3,4,5,6]</span></p>
<p><strong>输出:</strong> <span class="example-io">6</span></p>
<p><strong>解释:</strong></p>
<p>偶数为 2、4 和 6。它们的按位或运算结果是 6。</p>
</div>
<p><strong class="example">示例 2</strong></p>
<div class="example-block">
<p><strong>输入:</strong> <span class="example-io">nums = [7,9,11]</span></p>
<p><strong>输出:</strong> <span class="example-io">0</span></p>
<p><strong>解释:</strong></p>
<p>数组中没有偶数,因此结果为 0。</p>
</div>
<p><strong class="example">示例 3</strong></p>
<div class="example-block">
<p><strong>输入:</strong> <span class="example-io">nums = [1,8,16]</span></p>
<p><strong>输出:</strong> <span class="example-io">24</span></p>
<p><strong>解释:</strong></p>
<p>偶数为 8 和 16。它们的按位或运算结果是 24。</p>
</div>
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<ul>
<li><code>1 &lt;= nums.length &lt;= 100</code></li>
<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
</ul>