[leetcode] 967. Numbers With Same Consecutive Differences

Description

Return all non-negative integers of length n such that the absolute difference between every two consecutive digits is k.

Note that every number in the answer must not have leading zeros. For example, 01 has one leading zero and is invalid.

You may return the answer in any order.

Example 1:

Input: n = 3, k = 7
Output: [181,292,707,818,929]
Explanation: Note that 070 is not a valid number, because it has leading zeroes.

Example 2:

Input: n = 2, k = 1
Output: [10,12,21,23,32,34,43,45,54,56,65,67,76,78,87,89,98]

Example 3:

Input: n = 2, k = 0
Output: [11,22,33,44,55,66,77,88,99]

Example 4:

Input: n = 2, k = 1
Output: [10,12,21,23,32,34,43,45,54,56,65,67,76,78,87,89,98]

Example 5:

Input: n = 2, k = 2
Output: [13,20,24,31,35,42,46,53,57,64,68,75,79,86,97]

Constraints:

• 2 <= n <= 9
• 0 <= k <= 9

分析

题目的意思是：给定n和k，求出长度为n的数，数中各个位置的数的绝对值之差为k。这道题需要用dfs方法：

• 终止条件是搜索的长度达到了n，然后把num加入到结果就行了；
• 否则构造当前数的下一位数next_digits，然后遍历递归，就行了。

代码

class Solution:
    def dfs(self,n,num,k):
        if(n==0):
            self.res.append(num)
            return 
        tail=num%10
        next_digits=set([tail+k,tail-k])
        for item in next_digits:
            if(item>=0 and item<10):
                new_num=num*10+item
                self.dfs(n-1,new_num,k)
        
    def numsSameConsecDiff(self, n: int, k: int) -> List[int]:
        self.res=[]
        for num in range(1,10):
            self.dfs(n-1,num,k)
        return self.res

参考文献

solution