Simple Java O(n) use recursion, 0 ms, beat 100% on space and time
\n    public int[] getNoZeroIntegers(int n) {\n        int[] res = new int[2];\n        if (n < 2) return new int[]{0, n};\n        if (n/10 == 0) return new in
```\n    public int[] getNoZeroIntegers(int n) {\n        int[] res = new int[2];\n        if (n < 2) return new int[]{0, n};\n        if (n/10 == 0) return new int[]{1, n - 1};\n        int rem = n % 10;\n        if (rem < 2){\n            res = getNoZeroIntegers(n/10 - 1);\n            res[0] = res[0] * 10 + 2;\n            res[1] = res[1] * 10 + 10 + rem - 2;\n        } else {\n            res = getNoZeroIntegers(n/10);\n            res[0] = res[0] * 10 + 1;\n            res[1] = res[1] * 10 + rem -1;\n        }\n        return res;\n    }\n```\n\nRuntime: 0 ms, faster than 100.00% of Java online submissions for Convert Integer to the Sum of Two No-Zero Integers.\nMemory Usage: 34.8 MB, less than 100.00% of Java online submissions for Convert Integer to the Sum of Two No-Zero Integers.
[]