add 1625

fishercoder1534 · fishercoder1534 · commit 379c73e6857b · 2020-10-18T10:30:18.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1625|[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1625.java) ||BFS, DFS|Medium|
 |1624|[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1624.java) ||String|Easy|
 |1620|[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java) ||Greedy|Medium|
 |1619|[Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java) ||Array|Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_1625.java b/src/main/java/com/fishercoder/solutions/_1625.java
@@ -0,0 +1,43 @@
+package com.fishercoder.solutions;
+
+import java.util.HashSet;
+import java.util.LinkedList;
+import java.util.Queue;
+import java.util.Set;
+
+public class _1625 {
+    public static class Solution1 {
+        public String findLexSmallestString(String s, int a, int b) {
+            Queue<String> queue = new LinkedList<>();
+            Set<String> seen = new HashSet<>();
+            queue.offer(s);
+            String smallest = s;
+            while (!queue.isEmpty()) {
+                String current = queue.poll();
+                //add
+                char[] c = current.toCharArray();
+                for (int i = 1; i < c.length; i++) {
+                    if (i % 2 == 1) {
+                        c[i] = (char) (((Integer.parseInt(String.valueOf(c[i])) + a) % 10) + '0');
+                    }
+                }
+                String next = new String(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;
+                }
+            }
+            return smallest;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1625Test.java b/src/test/java/com/fishercoder/_1625Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1625;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1625Test {
+    private static _1625.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1625.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals("2050", solution1.findLexSmallestString("5525", 9, 2));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals("24", solution1.findLexSmallestString("74", 5, 1));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals("0011", solution1.findLexSmallestString("0011", 4, 2));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals("00553311", solution1.findLexSmallestString("43987654", 7, 3));
+    }
+
+}
