字符串最小表示法(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 th...
原创
2018-09-02 17:00:27 ·
741 阅读 ·
0 评论