Very Easy and Understandable 💡
Intuition\nThe problem asks us to find two positive integers that sum to the given integer n, and neither of these integers should contain a zero digit. We can 
# Intuition\nThe problem asks us to find two positive integers that sum to the given integer n, and neither of these integers should contain a zero digit. We can achieve this by iterating through potential candidates for one of the numbers and checking if the other number (calculated as n minus the candidate) also satisfies the no-zero-digit condition.\n\n# Approach\nIterate: We iterate through the possible values for the first number (i) from 1 to n/2. Since n is the sum of two numbers, we don\'t need to check values greater than n/2.\nCalculate the Complement: For each candidate i, we calculate the second number n - i.\nCheck for Zero Digits: We check if both i and n - i contain a zero digit using Integer.toString().contains("0").\nReturn Result: If both numbers satisfy the condition (no zeros), we store them in an array (res) and return it.\n\n# Complexity\n- Time complexity:\nO(n) - The loop iterates through half of the given number n at most.\n\n- Space complexity:\nO(1) - We use constant extra space to store the result array.\n\n# Code\n```java []\nclass Solution {\n    public int[] getNoZeroIntegers(int n) {\n        int []res=new int[2];\n        \n        for(int i=1;i<=n/2;i++){\n            if(i+n-i==n){\n                if(!Integer.toString(i).contains("0")&&!Integer.toString(n-i).contains("0")){\n                res[0]=i;\n                res[1]=n-i;\n                break;\n                }\n            }\n        }\n        return res;\n    }\n}\n```
['Java']