【Leetcode】1033. Moving Stones Until Consecutive

class Solution(object): def numMovesStones(self, a, b, c): """ the max is easy to get, the max equals to the farthest minus the nearest minus 2 for the case min, there are two cases: 1. sp

>>阅读原文<<