minimum-addition-to-make-integer-beautiful

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given two positive integers <code>n</code> and <code>target</code>.

An integer is considered beautiful if the sum of its digits is less than or equal to <code>target</code>.

Return the minimum non-negative integer <code>x</code> such that <code>n + x</code> is beautiful. The input will be generated such that it is always possible to make <code>n</code> beautiful.

&nbsp;
Example 1:

<pre>
Input: n = 16, target = 6
Output: 4
Explanation: Initially n is 16 and its digit sum is 1 + 6 = 7. After adding 4, n becomes 20 and digit sum becomes 2 + 0 = 2. It can be shown that we can not make n beautiful with adding non-negative integer less than 4.
</pre>

Example 2:

<pre>
Input: n = 467, target = 6
Output: 33
Explanation: Initially n is 467 and its digit sum is 4 + 6 + 7 = 17. After adding 33, n becomes 500 and digit sum becomes 5 + 0 + 0 = 5. It can be shown that we can not make n beautiful with adding non-negative integer less than 33.
</pre>

Example 3:

<pre>
Input: n = 1, target = 1
Output: 0
Explanation: Initially n is 1 and its digit sum is 1, which is already smaller than or equal to target.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 1012</code></li>
	<li><code>1 &lt;= target &lt;= 150</code></li>
	<li>The input will be generated such that it is always possible to make <code>n</code> beautiful.</li>
</ul>

makeIntegerBeautiful

Minimum Addition to Make Integer Beautiful

Happy Number

happy-number

快乐数

Greedy

Math

给你两个正整数 <code>n</code> 和 <code>target</code> 。

如果某个整数每一位上的数字相加小于或等于 <code>target</code> ，则认为这个整数是一个 美丽整数 。

找出并返回满足 <code>n + x</code> 是 美丽整数 的最小非负整数 <code>x</code> 。生成的输入保证总可以使 <code>n</code> 变成一个美丽整数。

&nbsp;

示例 1：

<pre>输入：n = 16, target = 6
输出：4
解释：最初，n 是 16 ，且其每一位数字的和是 1 + 6 = 7 。在加 4 之后，n 变为 20 且每一位数字的和变成 2 + 0 = 2 。可以证明无法加上一个小于 4 的非负整数使 n 变成一个美丽整数。
</pre>

示例 2：

<pre>输入：n = 467, target = 6
输出：33
解释：最初，n 是 467 ，且其每一位数字的和是 4 + 6 + 7 = 17 。在加 33 之后，n 变为 500 且每一位数字的和变成 5 + 0 + 0 = 5 。可以证明无法加上一个小于 33 的非负整数使 n 变成一个美丽整数。</pre>

示例 3：

<pre>输入：n = 1, target = 1
输出：0
解释：最初，n 是 1 ，且其每一位数字的和是 1 ，已经小于等于 target 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 1012</code></li>
	<li><code>1 &lt;= target &lt;= 150</code></li>
	<li>生成的输入保证总可以使 <code>n</code> 变成一个美丽整数。</li>
</ul>