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.
本题题意很简单，直接暴力求解即可
代码如下：
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <numeric>
#include <cmath>
#include <regex>
using namespace std;
class Solution
{
public:
vector<int> selfDividingNumbers(int left, int right)
{
vector<int> res;
for (int i = left; i <= right; i++)
{
if (check(i) == true)
res.push_back(i);
}
return res;
}
bool check(int num)
{
string s = to_string(num);
for (char c : s)
{
if (c == '0' || num % (c - '0') != 0)
return false;
}
return true;
}
};
