mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -7,7 +7,7 @@
|
||||
<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>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> deliciousness = [1,3,5,7,9]
|
||||
@@ -16,7 +16,7 @@
|
||||
Their respective sums are 4, 8, 8, and 16, all of which are powers of 2.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> deliciousness = [1,1,1,3,3,3,7]
|
||||
|
Reference in New Issue
Block a user