add 1061

Author: fishercoder1534

README.md

@@ -563,6 +563,7 @@ _If you like this project, please leave me a star._ ★
 | 1066 |[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1066.java)                                                                 |                                                                               | Medium                           |Backtracking, DP|
 | 1065 |[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java)                                                                 |                                                                               | Medium                           ||
 | 1062 |[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1062.java)                                                                 |                                                                               | Medium                           |String, Binary Search, DP, Rolling Hash, Suffix Array, Hash Function|
+| 1061 |[Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1061.java)                                                                 |                                                                               | Medium                           ||Union Find
 | 1057 |[Campus Bikes](https://leetcode.com/problems/campus-bikes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1057.java)                                                                 |                                                                               | Medium                           ||Greedy, Sort
 | 1056 |[Confusing Number](https://leetcode.com/problems/confusing-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java)                                                                 |                                                                               | Easy                             ||
 | 1055 |[Fixed Point](https://leetcode.com/problems/fixed-point/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java)                                                                 |                                                                               | Easy                             ||

src/main/java/com/fishercoder/solutions/_1061.java

@@ -0,0 +1,46 @@
+package com.fishercoder.solutions;
+
+public class _1061 {
+    public static class Solution1 {
+        public String smallestEquivalentString(String s1, String s2, String baseStr) {
+            UnionFind unionFind = new UnionFind();
+            for (int i = 0; i < s1.length(); i++) {
+                unionFind.union(s1.charAt(i), s2.charAt(i));
+            }
+            StringBuilder sb = new StringBuilder();
+            for (char c : baseStr.toCharArray()) {
+                sb.append((char) (unionFind.find(c) + 'a'));
+            }
+            return sb.toString();
+        }
+
+        class UnionFind {
+            int[] ids;
+
+            public UnionFind() {
+                this.ids = new int[26];
+                for (int i = 0; i < ids.length; i++) {
+                    ids[i] = i;
+                }
+            }
+
+            public void union(char a, char b) {
+                int x = find(a);
+                int y = find(b);
+                if (x < y) {
+                    ids[y] = x;
+                } else {
+                    ids[x] = y;
+                }
+            }
+
+            public int find(char x) {
+                while (x - 'a' != ids[x - 'a']) {
+                    ids[x - 'a'] = ids[ids[x - 'a']];
+                    x = (char) (ids[x - 'a'] + 'a');
+                }
+                return x - 'a';
+            }
+        }
+    }
+}

src/test/java/com/fishercoder/_1061Test.java

@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1061;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1061Test {
+    private static _1061.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1061.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals("makkek", solution1.smallestEquivalentString("parker", "morris", "parser"));
+    }
+
+}