[leetcode] 1317. Convert Integer to the Sum of Two No-Zero Integers

最新推荐文章于 2026-03-10 17:21:25 发布

原创最新推荐文章于 2026-03-10 17:21:25 发布 · 206 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode题解同时被 2 个专栏收录

904 篇文章

订阅专栏

python

559 篇文章

订阅专栏

博客围绕给定整数n，要找出两个非零整数A和B，使A、B不含0且A + B = n。给出了题目描述、示例及约束条件，分析解题思路是直接计算找出符合条件的数对，还提及会给出代码。

Description

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

分析

题目的意思是：给定一个数n，找出两个非零数n1，n2，并且n1,n2中其他位置不含有任何0，使得n1+n2=n。思路也很直接，直接照着算，找到一个符合条件的就行了

代码

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