899. Orderly Queue

You are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string..

Return the lexicographically smallest string you could have after applying the mentioned step any number of moves.

class Solution {
public:
    string orderlyQueue(string s, int k) {
        if(k == 1) {
            string res = s;
            for(int i = 0; i < s.length(); i++)
                res = min(res, s.substr(i) + s.substr(0,i));
            return res;
        } else {
            sort(begin(s),end(s));
            return s;
        }
    }
};