2022.8.3-----leetcode.899

public String orderlyQueue(String s, int k) {//k is 1, only one beginning can be selected in the character ring of s to make it the smallestif (k == 1) {String smallest = s;String ss =s+s;int n = s.length();for (int i = 1; i < n; i++) {if(ss.substring(i,i+n).compareTo(smallest)<0)smallest=ss.substring(i,i+n);}return smallest;} else {//k>1, the order of any two adjacent characters can be exchanged, and finally all characters can be sortedchar[] arr = s.toCharArray();Arrays.sort(arr);return new String(arr);}}