728. 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.

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.

class Solution {
public:
    vector selfDividingNumbers(int left, int right) {
        vector res;
        for(int i=left;i<=right;i++){
            if(isnum(i))  res.push_back(i);
        }
        return res;
    }
    int isnum(int num)
    {
        int n=num;
        int tmp;
        while(n){
            tmp=n%10;
            if(tmp==0 || num%tmp!=0) return 0;
            n=n/10;
        }
        return 1;
    }
};