leetcode1033

 class Solution:
     def numMovesStones(self, a: int, b: int, c: int) -> 'List[int]':
         l = list()
         l.append(a)
         l.append(b)
         l.append(c)
         l = sorted(l)

         r = list()
         minval = 0
         maxval = 0

         if l[1] - l[0] == 1 and l[2] - l[1] == 1:
             return [minval,maxval]
         elif (l[1] - l[0]==1) or (l[2]-l[1]==1) or (l[1] - l[0] == 2) or (l[2] - l[1] == 2):
             minval = 1
         else:
             minval = 2

         maxval += l[1] - l[0] - 1
         maxval += l[2] - l[1] - 1

         return [minval,maxval]

这道题出的有点不知所云。