728. Self Dividing Numbers
1. Description
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.
2. Example
Example 1:
Input: left = 1, right = 22
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
3. Constraints
- The boundaries of each input argument are 1 <= left <= right <= 10000.
4. Solutions
My Accepted Solution
n = (right - left)
Time complexity: O(n)
Space complexity: O(n)
class Solution
{
private:
bool isSelfDicidingNumber(int number)
{
string digits = to_string(number);
for(int i = 0; i < digits.size(); i++)
{
if(digits[i] == '0' || number % (digits[i] - '0') != 0)
return false;
}
return true;
}
public:
// vector<int> selfDividingNumbers(int left, int right)
vector<int> selfDividingNumbers(int left, int right)
{
vector<int> result;
for(int i = left; i <= right; i++)
{
if(isSelfDicidingNumber(i))
{
result.push_back(i);
}
}
return result;
}
};