2998. make X and Y Equal number of operations

topic：

Thought：

We will first x andNumber of operations 0 Put in a queue。Then，我们不断地从队列中取出当前的值andNumber of operations，Check whether the target value has reached the target value y。
if there is not，We will perform possible operation for this value，并将新值andNumber of operations加入队列中，Until finding the shortest path。

Code：

class Solution:
    def minimumOperationsToMakeEqual(self, x: int, y: int) -> int:
        # make用队列来进行Priority search
        queue = deque([(x, 0)])  # (The current value, Number of operations)
        visited = set()  # Used to record the values ​​that have been accessed，Avoid repeated treatment

        while queue:
            current, steps = queue.popleft()
            if current == y:
                return steps
            visited.add(current)

            # Explore four operations
            if current % 11 == 0 and current // 11 not in visited:
                queue.append((current // 11, steps + 1))
            if current % 5 == 0 and current // 5 not in visited:
                queue.append((current // 5, steps + 1))
            if current - 1 not in visited:
                queue.append((current - 1, steps + 1))
            if current + 1 not in visited:
                queue.append((current + 1, steps + 1))

        return -1  # 如果无法make x and y equal，Then return -1