Re: [閒聊] 每日leetcode

[sustainer123 (caster )]

推 pandix: node定義怪怪的 上下轉應該是for e in dic[int(lock[i])]   04/22 11:46
→ pandix:  之類的東西                                             04/22 11:46


感謝麵包屌

修改一下就過了

Python Code:
class Solution:
    def openLock(self, deadends: List[str], target: str) -> int:
        dic = defaultdict(list)

        for i in range(10):
            if i == 9:
                dic[9].append(0)
                dic[0].append(9)
            else:
                dic[i].append(i+1)
                dic[i+1].append(i)

        q = deque()
        q.append(("0000",0))
        visited = set(deadends)

        while q:
            lock,step = q.popleft()
            if lock == target:
                return step
            if lock in visited:
                continue
            visited.add(lock)
            for i in range(4):
                for e in dic[int(lock[i])]:
                    s = lock[:i]+str(e)+lock[i+1:]
                    if s not in visited:
                        q.append((s,step+1))

        return -1

不過時間空間都很糞 漬

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 114.43.132.44 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1713758834.A.15A.html
推 JIWP: 大師
推 DJYOSHITAKA: 別捲了
推 PyTorch: 大師