add 1323

fishercoder1534 · fishercoder1534 · commit 897547368353 · 2020-01-30T21:03:40.000-08:00
diff --git a/README.md b/README.md
@@ -11,6 +11,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) | |Medium||
 |1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | |Easy||
 |1329|[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) | |Medium||
+|1323|[Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1323.java) | |Easy|Math|
 |1317|[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1317.java) | |Easy||
 |1313|[Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1313.java) | |Easy|Array|
 |1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) | |Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_1323.java b/src/main/java/com/fishercoder/solutions/_1323.java
@@ -0,0 +1,43 @@
+package com.fishercoder.solutions;
+
+import java.util.stream.IntStream;
+
+/**
+ * 1323. Maximum 69 Number
+ *
+ * Given a positive integer num consisting only of digits 6 and 9.
+ * Return the maximum number you can get by changing at most one digit (6 becomes 9, and 9 becomes 6).
+ *
+ * Example 1:
+ * Input: num = 9669
+ * Output: 9969
+ * Explanation:
+ * Changing the first digit results in 6669.
+ * Changing the second digit results in 9969.
+ * Changing the third digit results in 9699.
+ * Changing the fourth digit results in 9666.
+ * The maximum number is 9969.
+ *
+ * Example 2:
+ * Input: num = 9996
+ * Output: 9999
+ * Explanation: Changing the last digit 6 to 9 results in the maximum number.
+ *
+ * Example 3:
+ * Input: num = 9999
+ * Output: 9999
+ * Explanation: It is better not to apply any change.
+ *
+ * Constraints:
+ * 1 <= num <= 10^4
+ * num's digits are 6 or 9.
+ * */
+public class _1323 {
+    public static class Solution1 {
+        public int maximum69Number (int num) {
+            char[] chars = Integer.toString(num).toCharArray();
+            IntStream.range(0, chars.length).filter(i -> chars[i] == '6').findFirst().ifPresent(i -> chars[i] = '9');
+            return Integer.parseInt(new String(chars));
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1323Test.java b/src/test/java/com/fishercoder/_1323Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1323;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1323Test {
+    private static _1323.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1323.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(9969, solution1.maximum69Number(9669));
+    }
+
+}
