LeetCode 728. 自除数

示例 1：

输入： 
上边界left = 1, 下边界right = 22
输出： [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> ans;
    	int i, num, bit;
    	bool flag;
        for(i = left; i <= right; ++i) 
        {
        	num = i;
        	flag = true;
        	while(num)
        	{
        		bit = num%10;
        		if(bit == 0 || i%bit != 0)
        			flag = false;
        		num /= 10;
        	}
        	if(flag)
        		ans.push_back(i);
        }
        return ans;
    }
};