mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
33 lines
1.4 KiB
HTML
33 lines
1.4 KiB
HTML
<p>A <strong>good meal</strong> is a meal that contains <strong>exactly two different food items</strong> with a sum of deliciousness equal to a power of two.</p>
|
||
|
||
<p>You can pick <strong>any</strong> two different foods to make a good meal.</p>
|
||
|
||
<p>Given an array of integers <code>deliciousness</code> where <code>deliciousness[i]</code> is the deliciousness of the <code>i<sup>th</sup></code> item of food, return <em>the number of different <strong>good meals</strong> you can make from this list modulo</em> <code>10<sup>9</sup> + 7</code>.</p>
|
||
|
||
<p>Note that items with different indices are considered different even if they have the same deliciousness value.</p>
|
||
|
||
<p> </p>
|
||
<p><strong>Example 1:</strong></p>
|
||
|
||
<pre>
|
||
<strong>Input:</strong> deliciousness = [1,3,5,7,9]
|
||
<strong>Output:</strong> 4
|
||
<strong>Explanation: </strong>The good meals are (1,3), (1,7), (3,5) and, (7,9).
|
||
Their respective sums are 4, 8, 8, and 16, all of which are powers of 2.
|
||
</pre>
|
||
|
||
<p><strong>Example 2:</strong></p>
|
||
|
||
<pre>
|
||
<strong>Input:</strong> deliciousness = [1,1,1,3,3,3,7]
|
||
<strong>Output:</strong> 15
|
||
<strong>Explanation: </strong>The good meals are (1,1) with 3 ways, (1,3) with 9 ways, and (1,7) with 3 ways.</pre>
|
||
|
||
<p> </p>
|
||
<p><strong>Constraints:</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= deliciousness.length <= 10<sup>5</sup></code></li>
|
||
<li><code>0 <= deliciousness[i] <= 2<sup>20</sup></code></li>
|
||
</ul>
|