字符串最小表示法（LeetCode 899. Orderly Queue ）

A string S of lowercase letters is given.  Then, we may make any number of moves.算法 In each move, we choose one of the first K letters (starting from the left), remove it, and place it at the end of t

>>阅读原文<<