_1625.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashSet;
importjava.util.LinkedList;
importjava.util.Queue;
importjava.util.Set;

publicclass_1625 {
publicstaticclassSolution1 {
publicStringfindLexSmallestString(Strings, inta, intb) {
Queue<String> queue = newLinkedList<>();
Set<String> seen = newHashSet<>();
queue.offer(s);
Stringsmallest = s;
while (!queue.isEmpty()) {
Stringcurrent = queue.poll();
// add
char[] c = current.toCharArray();
for (inti = 1; i < c.length; i++) {
if (i % 2 == 1) {
c[i] = (char) (((Integer.parseInt(String.valueOf(c[i])) + a) % 10) + '0');
 }
 }
Stringnext = newString(c);
if (smallest.compareTo(next) > 0) {
smallest = next;
 }
if (seen.add(next)) {
queue.add(next);
 }
// rotate
next = next.substring(next.length() - b) + next.substring(0, next.length() - b);
if (seen.add(next)) {
queue.add(next);
 }
if (smallest.compareTo(next) > 0) {
smallest = next;
 }
 }
returnsmallest;
 }
 }
}