self-dividing number is a number that is divisible by every digit it contains.
For example, 128 is a self-dividing number because 128 % 1 == 0
, 128 % 2 == 0
, and 128 % 8 == 0
.
Also, a self-dividing number is not allowed to contain the digit zero.
Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.
Example 1:
Input:
left = 1, right = 22
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
Note:
- The boundaries of each input argument are
1 <= left <= right <= 10000
.
自除数 是指可以被它包含的每一位数除尽的数。
例如,128 是一个自除数,因为 128 % 1 == 0
,128 % 2 == 0
,128 % 8 == 0
。
还有,自除数不允许包含 0 。
给定上边界和下边界数字,输出一个列表,列表的元素是边界(含边界)内所有的自除数。
示例 1:
输入: 上边界left = 1, 下边界right = 22 输出: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
注意:
- 每个输入参数的边界满足
1 <= left <= right <= 10000
。
题目思路:将[left,right]范围内的每一个数拆开,如果存在0或者不能被该数整除的数字,则不是self-dividing number
C++代码实现:
class Solution {
public:
vector<int> selfDividingNumbers(int left, int right) {
vector<int> result;
int m,n;
int flag;
for(;left<=right;left++)
{
m=left;
flag=1;
for(;m!=0;m=m/10)
{
n=m%10;
if(n==0||left%n!=0)
flag=0;
}
if(flag==1)
result.push_back(left);
}
return result;
}
};
JAVA代码实现:
class Solution {
public List<Integer> selfDividingNumbers(int left, int right) {
List<Integer> list = new ArrayList<>();
for(int i = left; i <= right; i++)
{
int j = i;
for( ; j > 0; j /= 10)
{
if(j % 10 ==0 || (i % (j % 10)) != 0)
break;
}
if(j == 0)
list.add(i);
}
return list;
}
}