DON'T ADD ZERO'S - SIMPLE
ApproachLoop through all numbers i from 1 to n - 1.For each number i, calculate j = n - i.Check if both i and j do not contain the digit 0.If true, return [i, j

# Approach
Loop through all numbers i from 1 to n - 1.

For each number i, calculate j = n - i.

Check if both i and j do not contain the digit 0.

If true, return [i, j] as the answer.

If no such pair is found (though problem guarantees there will be), return an empty array.

# Code
```java []
class Solution {
    public static int[] getNoZeroIntegers(int n) {
             	
    	for (int i = 0; i < n; i++) {
		
    		
    		int j = n-i;
    		
    		if(!String.valueOf(i).contains("0") && !String.valueOf(j).contains("0") ) {
    			return new int[] {i,j};
    		}
		}
    	return new int[] {};
    }
}
```
['Java']