add 1317

fishercoder1534 · fishercoder1534 · commit 6c36acd4fa71 · 2020-01-12T16:16:41.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|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||
 |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||
 |1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) | |Easy||
 |1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) | |Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_1317.java b/src/main/java/com/fishercoder/solutions/_1317.java
@@ -0,0 +1,64 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1317. Convert Integer to the Sum of Two No-Zero Integers
+ *
+ * Given an integer n. No-Zero integer is a positive integer which doesn't contain any 0 in its decimal representation.
+ *
+ * Return a list of two integers [A, B] where:
+ * A and B are No-Zero integers.
+ * A + B = n
+ * It's guarateed that there is at least one valid solution. If there are many valid solutions you can return any of them.
+ *
+ * Example 1:
+ * Input: n = 2
+ * Output: [1,1]
+ * Explanation: A = 1, B = 1. A + B = n and both A and B don't contain any 0 in their decimal representation.
+ *
+ * Example 2:
+ * Input: n = 11
+ * Output: [2,9]
+ *
+ * Example 3:
+ * Input: n = 10000
+ * Output: [1,9999]
+ *
+ * Example 4:
+ * Input: n = 69
+ * Output: [1,68]
+ *
+ * Example 5:
+ * Input: n = 1010
+ * Output: [11,999]
+ *
+ * Constraints:
+ * 2 <= n <= 10^4
+ * */
+public class _1317 {
+    public static class Solution1 {
+        public int[] getNoZeroIntegers(int n) {
+            int left = 1;
+            int right = n - 1;
+            while (left <= right) {
+                if (noZero(left) && noZero(right)) {
+                    return new int[]{left, right};
+                } else {
+                    left++;
+                    right--;
+                }
+            }
+            return null;
+        }
+
+        private boolean noZero(int num) {
+            while (num != 0) {
+                if (num % 10 == 0) {
+                    return false;
+                } else {
+                    num /= 10;
+                }
+            }
+            return true;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1317Test.java b/src/test/java/com/fishercoder/_1317Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1317;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1317Test {
+    private static _1317.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1317.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{11, 999}, solution1.getNoZeroIntegers(1010));
+    }
+
+}
