Simple java code 0 ms beats 100 %
Complexity\n\n- \n# Code\n\nclass Solution {\n    public boolean check(int n){\n        while(n>0){\n            if(n%10==0){\n                return false;\n  
# Complexity\n![image.png](https://assets.leetcode.com/users/images/a601ce3a-5b74-4d2b-951c-dc6cf74b0668_1707403148.7444394.png)\n- \n# Code\n```\nclass Solution {\n    public boolean check(int n){\n        while(n>0){\n            if(n%10==0){\n                return false;\n            }\n            n=n/10;\n        }\n        return true;\n    }\n    public int[] getNoZeroIntegers(int n) {\n        int a=1;\n        int b=n-1;\n        while(!check(a)||!check(b)) {\n            a=a+1;\n            b=b-1;\n        }\n        return new int[]{a,b};\n    }\n}\n```
['Math', 'Java']