Leetcode 93. Restore IP Addresses

class Solution:
    def restoreIpAddresses(self, s: str) -> List[str]:
        result = []
        chars = list(s)
        length = len(s)
        for i in range(1, length):
            for j in range(i+1, length):
                for k in range(j+1, length):
                    num1 = ''.join(chars[:i])
                    num2 = ''.join(chars[i:j])
                    num3 = ''.join(chars[j:k])
                    num4 = ''.join(chars[k:])
    
                    if self.validify(num1) and self.validify(num2) and self.validify(num3) and self.validify(num4):
                        ip_address = num1 + '.' + num2 + '.' + num3 + '.' + num4
                        result.append(ip_address)
        return result


    def validify(self, num):
        if len(num) == 0:
            return False
        elif len(num) > 1 and num[0] == '0':
            return False
        elif int(num) > 255:
            return False
        return True

class Solution:
    def restoreIpAddresses(self, s: str) -> List[str]:
        result = []
        chars = list(s)
        length = len(s)

        for i in range(1, 4):
            num1 = ''.join(chars[:i])
            if not self.validify(num1):
                continue
            for j in range(i+1, i+4):
                num2 = ''.join(chars[i:j])
                if not self.validify(num2):
                    continue
                for k in range(j+1, j+4):
                    num3 = ''.join(chars[j:k])
                    num4 = ''.join(chars[k:])
                    if self.validify(num3) and self.validify(num4):
                        ip_address = num1 + '.' + num2 + '.' + num3 + '.' + num4
                        result.append(ip_address)
        return result


    def validify(self, num):
        if len(num) == 0:
            return False
        elif len(num) > 1:
            if num[0] == '0':
                return False

        if int(num) > 255:
            return False
        return True