728. Self Dividing Numbers*
https://leetcode.com/problems/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.
C++ 实现 1
判断出 self-dividing 数字即可.
class Solution {
private:bool isSelfDividing(int num) {auto tmp = num;while (tmp) {auto n = tmp % 10;if (n == 0 || num % n != 0) return false;tmp /= 10;}return true;}
public:vector<int> selfDividingNumbers(int left, int right) {vector<int> res;for (int i = left; i <= right; ++ i) {if (isSelfDividing(i)) res.push_back(i);}return res;}
};