Leetcode 728.自除数

原题链接：Leetcode 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.
A self-dividing number is not allowed to contain the digit zero.

Given two integers left and right, return a list of all the self-dividing numbers in the range [left, right].

Example 1:

Input: left = 1, right = 22
Output: [1,2,3,4,5,6,7,8,9,11,12,15,22]

Example 2:

Input: left = 47, right = 85
Output: [48,55,66,77]

Constraints:

• 1 <= left <= right <= 104

---

方法一：模拟

c++代码：

class Solution {
public:
    // 判断是否是自除数
    bool check(int x){
        int tmp = x;
        while(tmp > 0){
            int digit = tmp % 10;
            if(digit == 0 || x % digit != 0) {
                return false;
            }
            tmp /= 10;
        }
        return true;
    }

    vector<int> selfDividingNumbers(int left, int right) {
        vector<int> ans;
        for(int i = left; i <= right; i++ ){
            if(check(i)) ans.emplace_back(i);
        }
        return ans;
    }
};

复杂度分析：

• 时间复杂度：O(nlogn)，总共有n个数，对每一个数进行判断需要O(logn)
• 空间复杂度：O(1) 除了返回值只有常数级别的开销