【LeetCode】728. 自除数

728. 自除数

class Solution {
public:
    vector<int> selfDividingNumbers(int left, int right) {
        vector<int> ans;
        for(int i=left; i<=right; ++i){
            int k = i;
            while(k){
                int t = k % 10;
                if(t == 0 || i % t != 0){
                    break;
                }
                k = k / 10;
            }
            if(k == 0){
                ans.push_back(i);
            }
        }
        return ans;
    }
};