Problem-98.py 文件源码

def search(pairs, squares):

    hits = set()
    for Len in pairs:
        candis = pairs[Len]
        spaces = squares[Len]
        for w1, w2 in candis:
            for sqs in spaces:
                numsqs = int(sqs)
                if numsqs in hits:
                    continue
                check = match(w1, sqs)
                if not check:
                    continue
                table = maketrans(w1, sqs)
                trans = w2.translate(table)
                if trans in spaces:
                    hits.add(numsqs)
                    hits.add(int(trans))

    return max(hits)