[Swift]LeetCode93. 复原IP地址 | Restore IP Addresses

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

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

Given a string containing only digits, restore it by returning all possible valid IP address combinations.

Example:

Input: "25525511135"
Output: ["255.255.11.135", "255.255.111.35"]

---

给定一个只包含数字的字符串，复原它并返回所有可能的 IP 地址格式。

示例:

输入: "25525511135"
输出: ["255.255.11.135", "255.255.111.35"]

---

16ms

class Solution {
    func restoreIpAddresses(_ s: String) -> [String] {
        if s.characters.count < 4 || s.characters.count > 12 {
            return []
        }
        
        let characters = Array(s.characters)
        var result = [String]()
        var candidate = [String]()
        
        backtracking(characters, 0, &candidate, &result)
        
        return result
    }
    private func backtracking(_ characters: [Character], _ pos: Int, _ candidate: inout [String], _ result: inout [String]) {
        if candidate.count == 4 {
            result.append(candidate.joined(separator: "."))
            return
        }
        
        let charsLeft = characters.count - pos
        let groupsLeft = 4 - candidate.count
        let minLen = groupsLeft == 1 ? charsLeft - groupsLeft + 1 : 1
        let maxLen = characters[pos] == "0" ? 1 : min(3, charsLeft - groupsLeft + 1)
        
        if minLen > maxLen {
            return
        }

        for len in minLen...maxLen {
            let num = String(characters[pos..<(pos + len)])
            if Int(num)! > 255 {
                continue
            }
            candidate.append(num)
            backtracking(characters, pos + len, &candidate, &result)
            candidate.removeLast()
        }
    }
}