[Java/C++] Simple Solution - Clean code
Java\njava\nclass Solution {\n    public int[] getNoZeroIntegers(int n) {\n        for (int a = 1; a < n; a++) {\n            int b = n - a;\n            if (!S
**Java**\n```java\nclass Solution {\n    public int[] getNoZeroIntegers(int n) {\n        for (int a = 1; a < n; a++) {\n            int b = n - a;\n            if (!String.valueOf(a).contains("0") && !String.valueOf(b).contains("0"))\n                return new int[]{a, b};\n        }\n        return new int[]{}; // unreachable because at least one valid solution\n    }\n}\n```\n\n**C++**\n```c++\nclass Solution {\npublic:\n    vector<int> getNoZeroIntegers(int n) {\n        for (int a = 1; a < n; ++a) {\n            int b = n - a;\n            if (to_string(a).find(\'0\') == string::npos && to_string(b).find(\'0\') == string::npos)\n                return {a, b};\n        }\n        return {}; // unreachable because at least one valid solution\n    }\n};\n```\n\n**Complexity:**\n- Time: O(n * log10(n)), `n <= 10^4`\n- Space: O(1)
[]