add 2566

fishercoder1534 · fishercoder1534 · commit b5767383eb9a · 2023-02-23T16:18:54.000-08: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                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
+| 2566 |[Maximum Difference by Remapping a Digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2566.java)                                                                     |                                                                               | Easy                             |
 | 2562 |[Find the Array Concatenation Value](https://leetcode.com/problems/find-the-array-concatenation-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2562.java)                                                                     |                                                                               | Easy                             |
 | 2559 |[Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2559.java)                                                                     |                                                                               | Medium                           |
 | 2558 |[Take Gifts From the Richest Pile](https://leetcode.com/problems/take-gifts-from-the-richest-pile/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2558.java)                                                                     |                                                                               | Easy                             |
diff --git a/src/main/java/com/fishercoder/solutions/_2566.java b/src/main/java/com/fishercoder/solutions/_2566.java
@@ -0,0 +1,54 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2566 {
+    public static class Solution1 {
+        public int minMaxDifference(int num) {
+            List<Integer> digits = new ArrayList<>();
+            while (num != 0) {
+                digits.add(num % 10);
+                num /= 10;
+            }
+            int toReplace = Integer.MAX_VALUE;
+            List<Integer> maxDigits = new ArrayList<>();
+            for (int i = digits.size() - 1; i >= 0; i--) {
+                if (toReplace == Integer.MAX_VALUE && digits.get(i) != 9) {
+                    toReplace = digits.get(i);
+                    maxDigits.add(9);
+                } else if (digits.get(i) == toReplace) {
+                    maxDigits.add(9);
+                } else {
+                    maxDigits.add(digits.get(i));
+                }
+            }
+            int max = 0;
+            int times = 1;
+            for (int i = maxDigits.size() - 1; i >= 0; i--) {
+                max += maxDigits.get(i) * times;
+                times *= 10;
+            }
+
+            toReplace = Integer.MIN_VALUE;
+            List<Integer> minDigits = new ArrayList<>();
+            for (int i = digits.size() - 1; i >= 0; i--) {
+                if (toReplace == Integer.MIN_VALUE && digits.get(i) != 0) {
+                    toReplace = digits.get(i);
+                    minDigits.add(0);
+                } else if (digits.get(i) == toReplace) {
+                    minDigits.add(0);
+                } else {
+                    minDigits.add(digits.get(i));
+                }
+            }
+            int min = 0;
+            times = 1;
+            for (int i = minDigits.size() - 1; i >= 0; i--) {
+                min += minDigits.get(i) * times;
+                times *= 10;
+            }
+            return max - min;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_2566Test.java b/src/test/java/com/fishercoder/_2566Test.java
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2566;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2566Test {
+    private static _2566.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2566.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(99009, solution1.minMaxDifference(11891));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(900, solution1.minMaxDifference(456));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(99, solution1.minMaxDifference(90));
+    }
+
+}
