Lexicographically Smallest String After Applying Operations

You are given a string s of even length consisting of digits from 0 to 9, and two integers a and b.

You can apply either of the following two operations any number of times and in any order on s:

• Add a to all odd indices of s (0-indexed). Digits post 9 are cycled back to 0. For example, if s = "3456" and a = 5, s becomes "3951".
• Rotate s to the right by b positions. For example, if s = "3456" and b = 1, s becomes "6345".

Return the lexicographically smallest string you can obtain by applying the above operations any number of times on s.

A string a is lexicographically smaller than a string b (of the same length) if in the first position where a and b differ, string a has a letter that appears earlier in the alphabet than the corresponding letter in b. For example, "0158" is lexicographically smaller than "0190" because the first position they differ is at the third letter, and '5' comes before '9'.

Example 1:

Input: s = "5525", a = 9, b = 2
Output: "2050"
Explanation: We can apply the following operations:
Start:  "5525"
Rotate: "2555"
Add:    "2454"
Add:    "2353"
Rotate: "5323"
Add:    "5222"
Add:    "5121"
​​​​​​​Rotate: "2151"
​​​​​​​Add:    "2050"​​​​​​​​​​​​
There is no way to obtain a string that is lexicographically smaller then "2050".

思路：搜集所有的string，然后求字典序最小的即可； 

class Solution {
    public String findLexSmallestString(String s, int a, int b) {
        TreeSet<String> treeset = new TreeSet<String>((m, n) -> (m.compareTo(n)));
        bfs(s, a, b, treeset);
        return treeset.first();
    }
    
    private void bfs(String s, int a, int b, TreeSet<String> treeset) {
        Queue<String> queue = new LinkedList<String>();
        queue.offer(s);
        
        while(!queue.isEmpty()) {
            String node = queue.poll();
            String anext = getNextA(node, a);
            String bnext = getNextB(node, b);
            if(!treeset.contains(anext)) {
                treeset.add(anext);
                queue.offer(anext);
            }
            if(!treeset.contains(bnext)) {
                treeset.add(bnext);
                queue.offer(bnext);
            }
        }
    }
    
    private String getNextA(String s, int a) {
        StringBuilder sb = new StringBuilder();
        for(int i = 0; i < s.length(); i++) {
            int c = s.charAt(i) - '0';
            if(i % 2 != 0) {
                sb.append((c + a) % 10);
            } else {
                sb.append(c);
            }
        }
        return sb.toString();
    }
    
    private String getNextB(String s, int b) {
        int n = s.length();
        b = b % n;
        return s.substring(n - b) + s.substring(0, n - b) ;
    }
}