sum-of-numbers-with-units-digit-k

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two integers <code>num</code> and <code>k</code>, consider a set of positive integers with the following properties:

<ul>
	<li>The units digit of each integer is <code>k</code>.</li>
	<li>The sum of the integers is <code>num</code>.</li>
</ul>

Return the minimum possible size of such a set, or <code>-1</code> if no such set exists.

Note:

<ul>
	<li>The set can contain multiple instances of the same integer, and the sum of an empty set is considered <code>0</code>.</li>
	<li>The units digit of a number is the rightmost digit of the number.</li>
</ul>

&nbsp;
Example 1:

<pre>
Input: num = 58, k = 9
Output: 2
Explanation:
One valid set is [9,49], as the sum is 58 and each integer has a units digit of 9.
Another valid set is [19,39].
It can be shown that 2 is the minimum possible size of a valid set.
</pre>

Example 2:

<pre>
Input: num = 37, k = 2
Output: -1
Explanation: It is not possible to obtain a sum of 37 using only integers that have a units digit of 2.
</pre>

Example 3:

<pre>
Input: num = 0, k = 7
Output: 0
Explanation: The sum of an empty set is considered 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= num &lt;= 3000</code></li>
	<li><code>0 &lt;= k &lt;= 9</code></li>
</ul>

minimumNumbers

Sum of Numbers With Units Digit K

Digit Count in Range

digit-count-in-range

范围内的数字计数

Count Integers With Even Digit Sum

count-integers-with-even-digit-sum

统计各位数字之和为偶数的整数个数

Sum of Number and Its Reverse

sum-of-number-and-its-reverse

反转之后的数字和

Greedy

Math

Dynamic Programming

Enumeration

给你两个整数 <code>num</code> 和 <code>k</code> ，考虑具有以下属性的正整数多重集：

<ul>
	<li>每个整数个位数字都是 <code>k</code> 。</li>
	<li>所有整数之和是 <code>num</code> 。</li>
</ul>

返回该多重集的最小大小，如果不存在这样的多重集，返回 <code>-1</code> 。

注意：

<ul>
	<li>多重集与集合类似，但多重集可以包含多个同一整数，空多重集的和为 <code>0</code> 。</li>
	<li>个位数字 是数字最右边的数位。</li>
</ul>

&nbsp;

示例 1：

<pre>
输入：num = 58, k = 9
输出：2
解释：
多重集 [9,49] 满足题目条件，和为 58 且每个整数的个位数字是 9 。
另一个满足条件的多重集是 [19,39] 。
可以证明 2 是满足题目条件的多重集的最小长度。
</pre>

示例 2：

<pre>
输入：num = 37, k = 2
输出：-1
解释：个位数字为 2 的整数无法相加得到 37 。</pre>

示例 3：

<pre>
输入：num = 0, k = 7
输出：0
解释：空多重集的和为 0 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>0 &lt;= num &lt;= 3000</code></li>
	<li><code>0 &lt;= k &lt;= 9</code></li>
</ul>