mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
42 lines
1.3 KiB
HTML
42 lines
1.3 KiB
HTML
|
<p>You are given a positive integer <code>num</code> consisting only of digits <code>6</code> and <code>9</code>.</p>
|
||
|
|
|
||
|
|
<p>Return <em>the maximum number you can get by changing <strong>at most</strong> one digit (</em><code>6</code><em> becomes </em><code>9</code><em>, and </em><code>9</code><em> becomes </em><code>6</code><em>)</em>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> num = 9669
|
||
|
|
<strong>Output:</strong> 9969
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
Changing the first digit results in 6669.
|
||
|
|
Changing the second digit results in 9969.
|
||
|
|
Changing the third digit results in 9699.
|
||
|
|
Changing the fourth digit results in 9666.
|
||
|
|
The maximum number is 9969.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> num = 9996
|
||
|
|
<strong>Output:</strong> 9999
|
||
|
|
<strong>Explanation:</strong> Changing the last digit 6 to 9 results in the maximum number.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 3:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> num = 9999
|
||
|
|
<strong>Output:</strong> 9999
|
||
|
|
<strong>Explanation:</strong> It is better not to apply any change.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= num <= 10<sup>4</sup></code></li>
|
||
|
|
<li><code>num</code> consists of only <code>6</code> and <code>9</code> digits.</li>
|
||
|
|
</ul>
|