代码随想录第28天 | 回溯算法part3

93 复原IP地址

思路与前一题一致，只不过需要注意允许个位数首位为0但不允许两位三位数首位为0

class Solution:
    def restoreIpAddresses(self, s: str) -> List[str]:
        self.record = []
        self.address = []
        self.length = len(s)
        self.backTrack(s,0)
        return self.record

    def backTrack(self,s,startIndex):
        if len(self.address) > 4:
            return
        elif len(self.address) == 4:
            if startIndex == self.length:
                self.record.append('.'.join(self.address))
            return
        for i in range(startIndex,self.length):
            num = s[startIndex:i+1]
            if len(num) >= 2 and num[0] == '0':
                continue
            if int(num) <= 255:
                self.address.append(num)
                # print(self.address)
                self.backTrack(s,i+1)
                self.address.pop()
        return

for循环内的写法稍有不同，不过逻辑一致
看解答，发现不合法直接就可以break而不用continue，因为不合法只有两种情况，大于255和前置0，再往后找也必然不合法

78 子集

这题有点变化，返回条件不再是startIndex==len(nums),而是遇到nums中最后一个元素在path中
而且收集元素在任何条件下都要收集，终止条件内也要收集

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        self.record = []
        self.path = []
        self.length = len(nums)
        self.backTrack(nums,0)
        return self.record

    def backTrack(self,nums,startIndex):
        if nums[-1] in self.path:
            self.record.append(self.path.copy())
            return
        self.record.append(self.path.copy())
        for i in range(startIndex,self.length):
            self.path.append(nums[i])
            print(self.path)
            self.backTrack(nums,i+1)
            self.path.pop()

90 子集II

与上一题区别在于nums中有重复元素了，使用了之前组合题的思路，使用used来跳过重复元素，但是居然没通过？？
ca,又忘记排序了

class Solution:
    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
        self.record = []
        self.set = []
        self.length = len(nums)
        used = [0 for i in range(self.length)]
        self.backTrack(sorted(nums),0,used)
        return self.record

    def backTrack(self,nums,startIndex,used):
        self.record.append(self.set.copy())
        if startIndex >= self.length:
            return
        for i in range(startIndex,self.length):
            if i > 0 and nums[i-1] == nums[i] and used[i-1] == 0:
                continue
            self.set.append(nums[i])
            used[i] = 1
            self.backTrack(nums,i+1,used)
            self.set.pop()
            used[i] = 0