self-dividing-numbers

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

A self-dividing number is a number that is divisible by every digit it contains.

<ul>
	<li>For example, <code>128</code> is a self-dividing number because <code>128 % 1 == 0</code>, <code>128 % 2 == 0</code>, and <code>128 % 8 == 0</code>.</li>
</ul>

A self-dividing number is not allowed to contain the digit zero.

Given two integers <code>left</code> and <code>right</code>, return a list of all the self-dividing numbers in the range <code>[left, right]</code> (both inclusive).

&nbsp;
Example 1:
<pre>Input: left = 1, right = 22
Output: [1,2,3,4,5,6,7,8,9,11,12,15,22]
</pre>Example 2:
<pre>Input: left = 47, right = 85
Output: [48,55,66,77]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= left &lt;= right &lt;= 104</code></li>
</ul>

selfDividingNumbers

Self Dividing Numbers

Perfect Number

perfect-number

完美数

Check if Number Has Equal Digit Count and Digit Value

check-if-number-has-equal-digit-count-and-digit-value

判断一个数的数字计数是否等于数位的值

Count the Digits That Divide a Number

count-the-digits-that-divide-a-number

统计能整除数字的位数

Math

自除数&nbsp;是指可以被它包含的每一位数整除的数。

<ul>
	<li>例如，<code>128</code> 是一个 自除数 ，因为&nbsp;<code>128 % 1 == 0</code>，<code>128 % 2 == 0</code>，<code>128 % 8 == 0</code>。</li>
</ul>

自除数 不允许包含 0 。

给定两个整数&nbsp;<code>left</code>&nbsp;和&nbsp;<code>right</code> ，返回一个列表，列表的元素是范围&nbsp;<code>[left, right]</code>（包括两个端点）内所有的 自除数 。

&nbsp;

示例 1：

<pre>
输入：left = 1, right = 22
输出：[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
</pre>

示例 2:

<pre>
输入：left = 47, right = 85
输出：[48,55,66,77]
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= left &lt;= right &lt;= 104</code></li>
</ul>