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.

示例:

Input: 
left = 1, right = 22
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]

直接看代码：

class Solution {
public:
    vector<int> selfDividingNumbers(int left, int right) {
		vector<int> res;
		for (int i = left; i <= right; i++)
		{
			if (isSelfDividing(i)) res.emplace_back(i);
		}
		return res;
	}
	bool isSelfDividing(int num)
	{
		int n = num;
		while (n)
		{
			int t = n % 10;
			if (!t) return false;
			if (num % t) return false;
			n /= 10;
		}
		return true;
	}
};