1033. Moving Stones Until Consecutive

class Solution(object):
    def numMovesStones(self, a, b, c):
        """
        :type a: int
        :type b: int
        :type c: int
        :rtype: List[int]
        """
        ls = []
        ls.append(a)
        ls.append(b)
        ls.append(c)
        ls.sort()


        a = ls[0]
        b = ls[1]
        c = ls[2]

        res = None

        if abs(a-c) == 2:
            return [0,0]

        # 如果a,b相邻，或者b,c相邻，或者a,b之间差一个值，或者b,c之间差一个值
        # 最小步数都是1。 否则，至少移动两步
        # example： [1,2,6] a,b相邻 | [1,3,4] b,c相邻 | [1,3,5] a,b之间差一个值，或者b,c之间差一个值
        if abs(a-b) == 1 or abs(b-c) == 1 or abs(a-b) == 2 or abs(b-c) == 2:
            mi = 1
        else:
            mi = 2

        tmp = (c-b-1) + (b-a-1)
        res = [mi, tmp]

        return res