numbers-with-same-consecutive-differences

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two integers n and k, return an array of all the integers of length <code>n</code> where the difference between every two consecutive digits is <code>k</code>. You may return the answer in any order.

Note that the integers should not have leading zeros. Integers as <code>02</code> and <code>043</code> are not allowed.

&nbsp;
Example 1:

<pre>
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.
</pre>

Example 2:

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

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= n &lt;= 9</code></li>
	<li><code>0 &lt;= k &lt;= 9</code></li>
</ul>

numsSameConsecDiff

Numbers With Same Consecutive Differences

Breadth-First Search

Backtracking

返回所有长度为 <code>n</code> 且满足其每两个连续位上的数字之间的差的绝对值为 <code>k</code> 的 非负整数 。

请注意，除了 数字 <code>0</code> 本身之外，答案中的每个数字都 不能 有前导零。例如，<code>01</code> 有一个前导零，所以是无效的；但 <code>0</code>&nbsp;是有效的。

你可以按 任何顺序 返回答案。

&nbsp;

示例 1：

<pre>
输入：n = 3, k = 7
输出：[181,292,707,818,929]
解释：注意，070 不是一个有效的数字，因为它有前导零。
</pre>

示例 2：

<pre>
输入：n = 2, k = 1
输出：[10,12,21,23,32,34,43,45,54,56,65,67,76,78,87,89,98]</pre>

示例 3：

<pre>
输入：n = 2, k = 0
输出：[11,22,33,44,55,66,77,88,99]
</pre>

示例 4：

<pre>
输入：n = 2, k = 2
输出：[13,20,24,31,35,42,46,53,57,64,68,75,79,86,97]
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= n &lt;= 9</code></li>
	<li><code>0 &lt;= k &lt;= 9</code></li>
</ul>