Minimum Jumps to Reach Home LeetCode solution in Python

1
class Solution:
2
    def minimumJumps(self, fb: List[int], a: int, b: int, x: int) -> int:
3
        fb = set(fb)
4
        q = deque([[0, 0, True]])
5
        while q:
6
            n, l, isf = q.popleft()
7
            if n < 0 or n in fb or n > 2000 + 2 * b:
8
                continue
9
            fb.add(n)
10
            if n == x:
11
                return l
12
            if isf and n - b > 0:
13
                q.append([n - b, l + 1, False])
14
            q.append([n + a, l + 1, True])
15
        return -1