原题链接:https://leetcode-cn.com/problems/numbers-with-same-consecutive-differences/
起始单位是1位数,对一个N位的数,那么可以看做是N-1位的数(以d结尾)加上d+K或d-K得到的。所以从起始数组开始遍历,每次判断最后一位数,在末尾加上d+K或d-K,这其中可能出现重复,用set进行除重。
vector<int> numsSameConsecDiff(int N, int K) {
vector<int> vec;
for (int i = 1; i <= 9; i++){
vec.push_back(i);
}
for (int i = 2; i <= N; i++){
set<int> s;
for (auto num : vec){
int d = num % 10;
if (d + K<10){
int num1 = num * 10 + d + K;
s.insert(num1);
}
if (d - K >= 0){
int num2 = num * 10 + d - K;
s.insert(num2);
}
}
vec.assign(s.begin(),s.end());
}
if(N==1){
vec.push_back(0);
}
return vec;
}