leetcode-problemset/leetcode-cn/problem (English)/没有公共位的整数最大乘积(English) [maximum-product-of-two-integers-with-no-common-bits].html

<p>You are given an integer array <code>nums</code>.</p>

<p>Your task is to find two <strong>distinct</strong> indices <code>i</code> and <code>j</code> such that the product <code>nums[i] * nums[j]</code> is <strong>maximized,</strong> and the binary representations of <code>nums[i]</code> and <code>nums[j]</code> do not share any common set bits.</p>

<p>Return the <strong>maximum</strong> possible product of such a pair. If no such pair exists, return 0.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">nums = [1,2,3,4,5,6,7]</span></p>

<p><strong>Output:</strong> <span class="example-io">12</span></p>

<p><strong>Explanation:</strong></p>

<p>The best pair is 3 (011) and 4 (100). They share no set bits and <code>3 * 4 = 12</code>.</p>
</div>

<p><strong class="example">Example 2:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">nums = [5,6,4]</span></p>

<p><strong>Output:</strong> <span class="example-io">0</span></p>

<p><strong>Explanation:</strong></p>

<p>Every pair of numbers has at least one common set bit. Hence, the answer is 0.</p>
</div>

<p><strong class="example">Example 3:</strong></p>

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">nums = [64,8,32]</span></p>

<p><strong>Output:</strong> <span class="example-io">2048</span></p>

<p><strong>Explanation:</strong></p>

<p>No pair of numbers share a common bit, so the answer is the product of the two maximum elements, 64 and 32 (<code>64 * 32 = 2048</code>).</p>
</div>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
</ul>