mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -13,7 +13,7 @@
|
||||
<p>Return <em>a <strong>sorted</strong> array of the unique integers.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> digits = [2,1,3,0]
|
||||
@@ -22,7 +22,7 @@
|
||||
Notice that there are no <strong>odd</strong> integers or integers with <strong>leading zeros</strong>.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> digits = [2,2,8,8,2]
|
||||
@@ -31,7 +31,7 @@ Notice that there are no <strong>odd</strong> integers or integers with <strong>
|
||||
In this example, the digit 8 is used twice each time in 288, 828, and 882.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 3:</strong></p>
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> digits = [3,7,5]
|
||||
|
Reference in New Issue
Block a user