solves convert integer to the sum of two no zero integers

Author: anishLearnsToCode

README.md

@@ -337,8 +337,8 @@
 | 1299 | [Replace Elements With Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side)           | [![Java](assets/java.png)](src/ReplaceElementWithGreatestElementOnRightSide.java) [![Python](assets/python.png)](python/replace_element_with_greatest_element_on_right_hand_side.py) |                                                                                                                                   |
 | 1304 | [Find N Unique Integers Sum Up To Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero)                                         |                                                         [![Java](assets/java.png)](src/FindNUniqueIntegersSumUpToZero.java)                                                          |                                                                                                                                   |
 | 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)                  |                                                                                                                                                                                      |                                                                                                                                   |
+| 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)                                                                                 |                                                                                                                                                                                      |                                                                                                                                   |
 | 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)                                                     |                                                                                                                                                                                      |                                                                                                                                   |

src/ConvertIntegerToTheSumOfTwoNoZeroIntegers.java

@@ -0,0 +1,18 @@
+public class ConvertIntegerToTheSumOfTwoNoZeroIntegers {
+    public int[] getNoZeroIntegers(int n) {
+        for (int i = 1 ; i <= n / 2 ; i++) {
+            if (isNonZeroInteger(i) && isNonZeroInteger(n - i)) {
+                return new int[] {i, n - i};
+            }
+        }
+        return new int[0];
+    }
+
+    private boolean isNonZeroInteger(int n) {
+        while (n > 0) {
+            if (n % 10 == 0) return false;
+            n /= 10;
+        }
+        return true;
+    }
+}