mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
38 lines
1.2 KiB
HTML
38 lines
1.2 KiB
HTML
<p><strong>No-Zero integer</strong> is a positive integer that <strong>does not contain any <code>0</code></strong> in its decimal representation.</p>
|
|
|
|
<p>Given an integer <code>n</code>, return <em>a list of two integers</em> <code>[a, b]</code> <em>where</em>:</p>
|
|
|
|
<ul>
|
|
<li><code>a</code> and <code>b</code> are <strong>No-Zero integers</strong>.</li>
|
|
<li><code>a + b = n</code></li>
|
|
</ul>
|
|
|
|
<p>The test cases are generated so that there is at least one valid solution. If there are many valid solutions, you can return any of them.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 2
|
|
<strong>Output:</strong> [1,1]
|
|
<strong>Explanation:</strong> Let a = 1 and b = 1.
|
|
Both a and b are no-zero integers, and a + b = 2 = n.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 11
|
|
<strong>Output:</strong> [2,9]
|
|
<strong>Explanation:</strong> Let a = 2 and b = 9.
|
|
Both a and b are no-zero integers, and a + b = 11 = n.
|
|
Note that there are other valid answers as [8, 3] that can be accepted.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= n <= 10<sup>4</sup></code></li>
|
|
</ul>
|