Moving Stones Until Consecutive LeetCode solution in Python

1
class Solution:
2
    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:
3
        a, b, c = sorted([a, b, c])
4
        d1 = abs(b - a) - 1
5
        d2 = abs(c - b) - 1
6
        mi = 2
7
        if d1 == 0 and d2 == 0:
8
            mi = 0
9
        elif d1 <= 1 or d2 <= 1:
10
            mi = 1
11
        ma = c - a - 2
12
        return [mi, ma]