488 祖玛游戏 python

没有找到这个题比较好的Java题解

class Solution:
    def findMinStep(self, board: str, hand: str) -> int:
        def remove(b):
            i = 0
            for j in range(len(b)+1):
                if j == len(b) or b[j] != b[i]:
                    if j - i >= 3:
                        return remove(b[:i]+b[j:])
                    i = j
            return b
        
        @lru_cache(None)
        def dfs(b, h):
            b = remove(b)
            if b and not h: return float('inf')
            if not b: return 0
            
            res = float('inf')
            for i in range(1, max(len(b)-1,2)):
                for j in range(len(h)):
                    res = min(res, 1 + dfs(b[:i] + h[j] + b[i:], h[:j] + h[j+1:]))
            return res
        
        hand = ''.join(filter(lambda x: x in board, hand))
        res = dfs(board, hand)
        return res if res != float('inf') else -1