best java solution with 0ms runtime
\n\n\n\n# Complexity\n- Time complexity:\nO(n)\n\n\n\n# Code\n\nclass Solution {\n    public int[] getNoZeroIntegers(int n) {\n        int[] res = new int[2];\n
\n\n\n\n# Complexity\n- Time complexity:\nO(n)\n\n\n\n# Code\n```\nclass Solution {\n    public int[] getNoZeroIntegers(int n) {\n        int[] res = new int[2];\n        \n        for (int i = 1; i < n; i++) {\n            int c = n - i;\n            if (check(c) && check(i)) {\n                res[0] = i;\n                res[1] = c;\n                return res;\n            }\n        }\n        \n        return res;\n    }\n\n    public boolean check(int m) {\n        while (m > 0) {\n            int digit = m % 10;\n            if (digit == 0) {\n                return false;\n            }\n            m /= 10;\n        }\n        return true;\n    }\n}\n\n```
['Java']