mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
存量题库数据更新
This commit is contained in:
@@ -9,10 +9,10 @@
|
||||
<p>Given two integers <code>left</code> and <code>right</code>, return <em>a list of all the <strong>self-dividing numbers</strong> in the range</em> <code>[left, right]</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<pre><strong>Input:</strong> left = 1, right = 22
|
||||
<strong>Output:</strong> [1,2,3,4,5,6,7,8,9,11,12,15,22]
|
||||
</pre><p><strong>Example 2:</strong></p>
|
||||
</pre><p><strong class="example">Example 2:</strong></p>
|
||||
<pre><strong>Input:</strong> left = 47, right = 85
|
||||
<strong>Output:</strong> [48,55,66,77]
|
||||
</pre>
|
||||
|
Reference in New Issue
Block a user