solves maximum number 69

Author: anishLearnsToCode

README.md

@@ -339,7 +339,7 @@
 | 1309 | [Decrypt String From Alphabet To Integer Mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping)                     |                                                    [![Java](assets/java.png)](src/DecryptStringFromAlphabetToIntegerMapping.java)                                                    |                                                                                                                                   |
 | 1313 | [Decompress Run-Length Encoded Strings](https://leetcode.com/problems/decompress-run-length-encoded-list)                                            |                                                         [![Java](assets/java.png)](src/DecompressRunLengthEncodedList.java)                                                          |                                                                                                                                   |
 | 1317 | [Convert Integer to Sum Of Two Non-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers)                  |                                                    [![Java](assets/java.png)](src/ConvertIntegerToTheSumOfTwoNoZeroIntegers.java)                                                    |                                                                                                                                   |
-| 1323 | [Maximum 69 Number](https://leetcode.com/problems/maximum-69-number)                                                                                 |                                                                                                                                                                                      |                                                                                                                                   |
+| 1323 | [Maximum 69 Number](https://leetcode.com/problems/maximum-69-number)                                                                                 |                                                                 [![Java](assets/java.png)](src/Maximum69Number.java)                                                                 |                                                                                                                                   |
 | 1331 | [Rank Transform of An Array](https://leetcode.com/problems/rank-transform-of-an-array)                                                               |                                                                                                                                                                                      |                                                                                                                                   |
 | 1332 | [Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences)                                                     |                                                                                                                                                                                      |                                                                                                                                   |
 | 1337 | [The K Weakest Rows In A Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix)                                                       |                                                                                                                                                                                      |                                                                                                                                   |

src/Maximum69Number.java

@@ -0,0 +1,19 @@
+public class Maximum69Number {
+    public int maximum69Number (int num) {
+        int result = 0;
+        int divisor = 10_000;
+        boolean changed = false;
+        while (num > 0) {
+            result *= 10;
+            if (!changed && num / divisor == 6) {
+                result += 9;
+                changed = true;
+            } else {
+                result += num / divisor;
+            }
+            num -= (num / divisor) * divisor;
+            divisor /= 10;
+        }
+        return result;
+    }
+}