LeetCode 面试题 - 自除数

题目来源：LeetCode

 

 

代码：

 

class Solution {
public:
    vector<int> selfDividingNumbers(int left, int right) {
        vector<int> res;
        for(int i=left;i<=right;i++){
            int flag = 1;
            int n = i,m;
            while(n > 0){
                m = n%10;
                n = n/10;
                if(m == 0){
                    flag=0;break;
                }
                if(i%m){
                    flag = 0;break;
                }
            }
            if(flag){
                res.push_back(i);
            }
        }
        return res;
    }
};