LeetCode 899. Orderly Queue

class Solution {
public:
    string orderlyQueue(string S, int K) {
        if(K >= 2){
            sort(S.begin(),S.end());
            return S;
        }
        //else k==1
        string res = S;
        int len = S.size();
        S = S+S;
        for(int i=0;i

主要在于理解其性质