728. Self Dividing Numbers
A 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.
思路
就是很傻的按照所谓可以自除的概念去写代码,要注意判断有没有含0的位,加上这么一个判断。
class Solution {
public:
vector<int> selfDividingNumbers(int left, int right) {
vector<int> result;
for(int i = left;i <= right;i++){
if(canBeDivided(i))
result.push_back(i);
}
return result;
}
bool canBeDivided(int number){
int origin = number;//因为后面要做除10的操作来得到每一位的数,所以先保存到origin变量里
bool can = true;
//先循环判断有没有0的位
while(number){
if(number % 10 == 0){
can = false;
break;
}
number /= 10;
}
number = origin;
while(number%10){
if(origin%(number%10)!=0){
can = false;
break;
}
number /= 10;
}
return can;
}
};