【C++】728. Self Dividing Numbers

两个错误：

1. 在带返回值的函数里忘记写return那一行
2. 除零问题

感觉自己还远没有一个合格程序员的修养。需要再多努力才行呐。

题目如下：

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:
    int selfDivide(int num)
    {
        int temp = num, ones;
        while(temp)
        {
            ones = temp % 10;
            if(ones == 0 || num % ones != 0) return 0;
            temp /= 10;
        }
        return 1; 
    }
    
    vector<int> selfDividingNumbers(int left, int right) {
        vector<int> vec;
        for(int i=left; i<=right; i++)
        {
            if(selfDivide(i)) vec.push_back(i);
        }
        return vec;
    }
};