365天挑战LeetCode1000题——Day 048 有序队列 脑筋急转弯

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