Given an integer n. No-Zero integer is a positive integer which doesn’t contain any 0 in its decimal representation.

Return a list of two integers [A, B] where:

  • A and B are No-Zero integers.
  • A + B = n

It’s guarateed that there is at least one valid solution. If there are many valid solutions you can return any of them.

Example 1:
Input: n = 2
Output: [1,1]
Explanation: A = 1, B = 1. A + B = n and both A and B don’t contain any 0 in their decimal representation.

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]

Constraints:

  • 2 <= n <= 10^4

Solution in python:

class Solution:
    def getNoZeroIntegers(self, n: int) -> List[int]:
        def isZero(n):
            while n > 0:
                n, r = divmod(n, 10)
                if r == 0:
                    return False
            return True
        for i in range(1, n//2+1):
            if isZero(i) and isZero(n-i):
                return [i, n-i]
最后修改日期: 2021年3月9日

留言

撰写回覆或留言

发布留言必须填写的电子邮件地址不会公开。