leetcode 899 solution

 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.

 

Example 1:

Input: s = "cba", k = 1
Output: "acb"
Explanation: 
In the first move, we move the 1st character 'c' to the end, obtaining the string "bac".
In the second move, we move the 1st character 'b' to the end, obtaining the final result "acb".

Example 2:

Input: s = "baaca", k = 3
Output: "aaabc"
Explanation: 
In the first move, we move the 1st character 'b' to the end, obtaining the string "aacab".
In the second move, we move the 3rd character 'c' to the end, obtaining the final result "aaabc".

 

Constraints:

• 1 <= k <= s.length <= 1000
• s consist of lowercase English letters.

solution:

class Solution {

public:

    string orderlyQueue(string s, int k) {

        

        if (k == 1) {

            string ans = s;

            // Append |s| to itself and look for the smallest string

            // of as the same lenght as |s|.

            s += s;

            for (int i = 1; i < size(ans); ++i)

                ans = min(ans, s.substr(i, size(ans)));

            return ans;

        }

        

        // With k > 1 we can reorder |s| how we want, so sorting it

        // will yield the lexicographically smallest one.

        sort(begin(s), end(s));

        return s;

        

    }

};