Leetcode simple problem: converting an integer to the sum of two zero free integers

subject

「 Zero free integer 」 Is in the decimal representation It doesn't contain any 0 The positive integer .
Give you an integer n, Please return one A list of two integers [A, B], Satisfy ：
A and B Are zero free integers
A + B = n
The problem data ensures that there is at least one effective solution .
If there are multiple effective solutions , You can return any of them .
Example 1：
Input ：n = 2
Output ：[1,1]
explain ：A = 1, B = 1. A + B = n also A and B The decimal representation of does not contain any 0 .
Example 2：
Input ：n = 11
Output ：[2,9]
Example 3：
Input ：n = 10000
Output ：[1,9999]
Example 4：
Input ：n = 69
Output ：[1,68]
Example 5：
Input ：n = 1010
Output ：[11,999]
Tips ：
2 <= n <= 10^4
source ： Power button （LeetCode）

Their thinking

   First, define a function that decomposes each bit , Then loop through various situations , Return the qualified conditions .

class Solution:
    def getNoZeroIntegers(self, n: int) -> List[int]:
        def find(n):
            while n>0:
                if not n%10:
                    return False
                n//=10
            return True
        for i in range(1,n):
            if find(i) and find(n-i):
                return [i,n-i]