LeetCode——Self Dividing Numbers（728）

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.

分析：

题目要求出从left到right的自除数。自除数指不包含0的，能够被组成自己的数整除的数。比如题目的128，128%1=0，128&2=0，128%8=0。暴力求解即可

代码：

class Solution {
public:
    vector<int> selfDividingNumbers(int left, int right) {
        int temp;
        int res;
        int div;
        bool flag;
        vector<int> r;
        for(int i=left;i<=right;++i)
        {
            div = 1;
            flag = true;
            temp = i;
            do{
                res=temp%10;
                if(res ==0 ||i%res)
                {
                    flag = false;
                    break;
                }
            }
            while(temp = temp/10);
            if(flag)
                r.push_back(i);
        }
        return r;
    }
};