Title description
A "zero-zero integer" is a positive integer without any 0 in the decimal representation.
Give you an integer n, please return a list of two integers [A, B], satisfying:
A and B are zero-zero integers
A + B = n
The problem data guarantee at least one effective solution.
If there are multiple valid solutions, you can return to any one of them.
Example
示例 1：
输入：n = 2
输出：[1,1]
解释：A = 1, B = 1. A + B = n 并且 A 和 B 的十进制表示形式都不包含任何 0 。
示例 2：
输入：n = 11
输出：[2,9]
示例 3：
输入：n = 10000
输出：[1,9999]
示例 4：
输入：n = 69
输出：[1,68]
示例 5：
输入：n = 1010
输出：[11,999]
prompt
2 <= n <= 10^4
Problem solving ideas
Use a for loop to verify whether i and ni contain zero, if not, output
Code
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
bool ifnotHavezero(int num){
if(num==0)return false;
int temp=0;
while(num){
temp=num%10;
num/=10;
if(temp==0)return false;
}return true;
}
int* getNoZeroIntegers(int n, int* returnSize){
int *re=malloc(2*sizeof(int));
*returnSize=2;
for(int i=1;i<n;i++){
if(ifnotHavezero(i)&&ifnotHavezero(n-i)){
re[0]=i;
re[1]=n-i;
return re;
}
}re[0]=-1;
re[1]=-1;
return re;
}