class Solution:
    """
    @param S: a string
    @return:  return the minimum number of moves
    """
    ‘‘‘
    大致思路：
    1.初始化count=0,如果当前的字符串连续次数//3 == 0的话，不加，否则count += 连续次数//3,最终返回
    ‘‘‘
    def MinimumMoves(self,S):
        if S == ‘‘:
            return 0
        count = 0 
        n = 1
        p = S[0]
        S = S + ‘ ‘
        for i in range(1,len(S)):
            if p == S[i]:
                n += 1
            else:
                count += n//3
                p = S[i]
                n = 1
        return  count