package leetcode;

import java.util.Arrays;

/**
 * https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/
 */
public class Problem1317 {
    public int[] getNoZeroIntegers(int n) {
        int[] answer = new int[2];
        // TODO
        return answer;
    }

    public static void main(String[] args) {
        Problem1317 prob = new Problem1317();
        System.out.println(Arrays.toString(prob.getNoZeroIntegers(2))); // [1,1]
        System.out.println(Arrays.toString(prob.getNoZeroIntegers(11))); // [2,9]
        System.out.println(Arrays.toString(prob.getNoZeroIntegers(10000))); // [1,9999]
        System.out.println(Arrays.toString(prob.getNoZeroIntegers(69))); // [1,68]
        System.out.println(Arrays.toString(prob.getNoZeroIntegers(1010))); // [11,999]
    }
}

@@ -16,34 +16,8 @@
 e;%0A%0A
-import java.util.Arrays;%0A%0A
 /**%0A
@@ -223,557 +223,324 @@
     
-// TODO%0A        return answer;%0A
+for (int i = 1; i %3C= n; i++) %7B%0A 
     
-%7D%0A%0A
     
-public static void main(String%5B%5D args) %7B%0A        Problem1317 prob = new Problem1317();%0A        System.out.println(Arrays.toString(prob.getNoZeroIntegers(2))); // %5B1,1%5D%0A        System.out.println(Arrays.toString(prob.getNoZeroIntegers(11))); // %5B2,9%5D%0A        System.out.println(Arrays.toString(prob.getNoZeroIntegers(10000))); // %5B1,9999%5D%0A        System.out.println(Arrays.toString(prob.getNoZeroIntegers(69))); // %5B1,68%5D%0A        System.out.println(Arrays.toString(prob.getNoZeroIntegers(1010))); // %5B11,999%5D
+   int a = i;%0A            int b = n - a;%0A            if (Integer.toString(a).contains(%220%22) %7C%7C Integer.toString(b).contains(%220%22)) %7B%0A                continue;%0A            %7D%0A            answer%5B0%5D = a;%0A            answer%5B1%5D = b;%0A            break;%0A        %7D%0A        return answer;
 %0A   

Solve problem 1317