[Swift]LeetCode728. 自除数 | Self Dividing Numbers

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10516387.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

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.

---

自除数 是指可以被它包含的每一位数除尽的数。

例如，128 是一个自除数，因为 128 % 1 == 0，128 % 2 == 0，128 % 8 == 0。

还有，自除数不允许包含 0 。

给定上边界和下边界数字，输出一个列表，列表的元素是边界（含边界）内所有的自除数。

示例 1：

输入： 
上边界left = 1, 下边界right = 22
输出： [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]

注意：

• 每个输入参数的边界满足 1 <= left <= right <= 10000。

---

Runtime: 8 ms

Memory Usage: 18.8 MB

class Solution {
    func selfDividingNumbers(_ left: Int, _ right: Int) -> [Int] {
        var res:[Int] = [Int]()
        var n:Int = 0
        for i in left...right
        {
            n = i
            while(n > 0)
            {
                if n % 10 == 0 || i % (n % 10) != 0
                {
                    break
                }
                n /= 10
            }
            if n == 0
            {
                res.append(i)
            }
        }
        return res
    }
}

---

8ms

class Solution {
    func selfDividingNumbers(_ left: Int, _ right: Int) -> [Int] {
        var result = [Int]()
        loop: for i in left...right {
            var number = i
            while number != 0 {
                if number % 10 == 0 {
                    continue loop
                }
                if i % ( number % 10 ) != 0 {
                    continue loop
                }
                number = number / 10
            }
            result.append(i)
        }
        return result
    }
}

---

12ms

class Solution {
    func selfDividingNumbers(_ left: Int, _ right: Int) -> [Int] {
    var result: [Int] = []
    var resultTrue = false
    if left == 1 { result.append(left) }
    First: for num in left...right {
        var temp: Int = num
        while temp > 1 {
            guard temp % 10 != 0 else { resultTrue = false; break }
            if num % (temp % 10) == 0 {
                resultTrue = true
            }
            else { resultTrue = false; break }
            temp = temp / 10
        }
        if resultTrue {
            result.append(num)
        }
    }
    return result
    }
}

---

12ms

class Solution {
    func selfDividingNumbers(_ left: Int, _ right: Int) -> [Int] {
    var resultArr: [Int] = []
    
    for num in left...right {
        if check(num) {
            resultArr.append(num)
        }
    }
    
    return resultArr
}

func check(_ num: Int) -> Bool {
    var n = num
    while n != 0 {
        let a = n % 10
        if a == 0 { return false }
        if num % a != 0 { return false }
        n /= 10
    }
    
    return true
  }
}

---

24ms

class Solution {
    func selfDividingNumbers(_ left: Int, _ right: Int) -> [Int] {
       return(left...right).filter{
            var i = $0
            while(i > 0){
                if (i % 10 == 0) || ($0 % (i % 10) != 0) { break }
                i /= 10
            }
            return i == 0 ? true : false 
        }
    }
}

---

28ms

class Solution {
    func selfDividingNumbers(_ left: Int, _ right: Int) -> [Int] {
        let nums = [Int](left...right)
        var selfDividingVals = [Int]()
        
        for num in nums {
            if num < 10 {
                selfDividingVals.append(num)
            } else if num <= 100 {
                if canDivide(with: num, zeroCount: 2) {
                    selfDividingVals.append(num)
                }
            } else if num <= 1000 {
                if canDivide(with: num, zeroCount: 3) {
                    selfDividingVals.append(num)
                }
            } else if num <= 10000 {
                if canDivide(with: num, zeroCount: 4) {
                    selfDividingVals.append(num)
                }
            }
        }
        return selfDividingVals
    }

    func canDivide(with num: Int, zeroCount: Int) -> Bool {
        for i in 0..<zeroCount {
            // Shift right
            let exp = Int(pow(Double(10), Double(i)))
                    
            // Get last value
            let val = (num / exp) % 10
                    
            // See if division works!
            if val == 0 || num % val != 0 {
                return false
            }
        }        
        return true
    }
}

---

40ms

class Solution {
func selfDividingNumbers(_ left: Int, _ right: Int) -> [Int] {
    var result: [Int] = []    
    for i in left...right {
        if i < 10 { result.append(i) }
        else if isSelfDividing(num: i) { result.append(i) }
    }    
    return result
}

func isSelfDividing(num: Int) -> Bool {
    guard let digits: [Int] = digitalize(num: num), digits.count != 0 else { return false }    
    var result: Bool?    
    digits.forEach { (digit) in
        if num % digit != 0 { result = false }
    }    
    return result ?? true
}

func digitalize(num: Int) -> [Int] {
    var _num: Int = num
    var result: [Int] = []    
    while _num > 0 {
        if _num % 10 == 0 { return [] }
        result.append(_num % 10)
        _num = _num / 10
    }    
    return result
  }
}

---

116ms

class Solution {
    func selfDividingNumbers(_ left: Int, _ right: Int) -> [Int] {
        var result = [Int]()
        for x in left...right {
            if x < 10 {
                result.append(x)
            } else {
                let digits = Array(String(x)).map { Int(String($0))! }
                if digits.allSatisfy({ $0 != 0 && x % $0 == 0 }) {
                    result.append(x)
                }
            }
        }
        return result
    }
}