1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-03-14 16:22:24 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
leetcode-problemset/leetcode-cn/problem (Chinese)/按位与为零的三元组 [triples-with-bitwise-and-equal-to-zero].html

48 lines
1.4 KiB
HTML
Raw Normal View History

2023-12-09 18:42:21 +08:00
<p>给你一个整数数组 <code>nums</code> ,返回其中 <strong>按位与三元组</strong> 的数目。</p>
<p><strong>按位与三元组</strong> 是由下标 <code>(i, j, k)</code> 组成的三元组,并满足下述全部条件:</p>
2022-03-27 20:46:41 +08:00
<ul>
2023-12-09 18:42:21 +08:00
<li><code>0 &lt;= i &lt; nums.length</code></li>
<li><code>0 &lt;= j &lt; nums.length</code></li>
<li><code>0 &lt;= k &lt; nums.length</code></li>
<li><code>nums[i] &amp; nums[j] &amp; nums[k] == 0</code> ,其中 <code>&amp;</code> 表示按位与运算符。</li>
2022-03-27 20:46:41 +08:00
</ul>
2023-12-09 18:42:21 +08:00
&nbsp;
2022-03-27 20:46:41 +08:00
2023-12-09 18:42:21 +08:00
<p><strong>示例 1</strong></p>
2022-03-27 20:46:41 +08:00
2023-12-09 18:42:21 +08:00
<pre>
<strong>输入:</strong>nums = [2,1,3]
2022-03-27 20:46:41 +08:00
<strong>输出:</strong>12
2023-12-09 18:42:21 +08:00
<strong>解释:</strong>可以选出如下 i, j, k 三元组:
2022-03-27 20:46:41 +08:00
(i=0, j=0, k=1) : 2 &amp; 2 &amp; 1
(i=0, j=1, k=0) : 2 &amp; 1 &amp; 2
(i=0, j=1, k=1) : 2 &amp; 1 &amp; 1
(i=0, j=1, k=2) : 2 &amp; 1 &amp; 3
(i=0, j=2, k=1) : 2 &amp; 3 &amp; 1
(i=1, j=0, k=0) : 1 &amp; 2 &amp; 2
(i=1, j=0, k=1) : 1 &amp; 2 &amp; 1
(i=1, j=0, k=2) : 1 &amp; 2 &amp; 3
(i=1, j=1, k=0) : 1 &amp; 1 &amp; 2
(i=1, j=2, k=0) : 1 &amp; 3 &amp; 2
(i=2, j=0, k=1) : 3 &amp; 2 &amp; 1
(i=2, j=1, k=0) : 3 &amp; 1 &amp; 2
</pre>
2023-12-09 18:42:21 +08:00
<p><strong>示例 2</strong></p>
<pre>
<strong>输入:</strong>nums = [0,0,0]
<strong>输出:</strong>27
</pre>
2022-03-27 20:46:41 +08:00
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
2023-12-09 18:42:21 +08:00
<ul>
<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
<li><code>0 &lt;= nums[i] &lt; 2<sup>16</sup></code></li>
</ul>