mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
67 lines
2.4 KiB
HTML
67 lines
2.4 KiB
HTML
<p>You are given two integers <code>n</code> and <code>m</code> that consist of the <strong>same</strong> number of digits.</p>
|
|
|
|
<p>You can perform the following operations <strong>any</strong> number of times:</p>
|
|
|
|
<ul>
|
|
<li>Choose <strong>any</strong> digit from <code>n</code> that is not 9 and <strong>increase</strong> it by 1.</li>
|
|
<li>Choose <strong>any</strong> digit from <code>n</code> that is not 0 and <strong>decrease</strong> it by 1.</li>
|
|
</ul>
|
|
|
|
<p>The integer <code>n</code> must not be a <span data-keyword="prime-number">prime</span> number at any point, including its original value and after each operation.</p>
|
|
|
|
<p>The cost of a transformation is the sum of <strong>all</strong> values that <code>n</code> takes throughout the operations performed.</p>
|
|
|
|
<p>Return the <strong>minimum</strong> cost to transform <code>n</code> into <code>m</code>. If it is impossible, return -1.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">n = 10, m = 12</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">85</span></p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<p>We perform the following operations:</p>
|
|
|
|
<ul>
|
|
<li>Increase the first digit, now <code>n = <u><strong>2</strong></u>0</code>.</li>
|
|
<li>Increase the second digit, now <code>n = 2<strong><u>1</u></strong></code>.</li>
|
|
<li>Increase the second digit, now <code>n = 2<strong><u>2</u></strong></code>.</li>
|
|
<li>Decrease the first digit, now <code>n = <strong><u>1</u></strong>2</code>.</li>
|
|
</ul>
|
|
</div>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">n = 4, m = 8</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">-1</span></p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<p>It is impossible to make <code>n</code> equal to <code>m</code>.</p>
|
|
</div>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">n = 6, m = 2</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">-1</span></p>
|
|
|
|
<p><strong>Explanation:</strong> </p>
|
|
|
|
<p>Since 2 is already a prime, we can't make <code>n</code> equal to <code>m</code>.</p>
|
|
</div>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= n, m < 10<sup>4</sup></code></li>
|
|
<li><code>n</code> and <code>m</code> consist of the same number of digits.</li>
|
|
</ul>
|