题目链接:统计范围内的步进数字数目
题解:数位dp
1. 数位dp一般都需要用到前缀的思想,定义f(x)为小于等于i的"步进数字"个数,则区间[low, high]的"步进数字"数为f(high) - f(low - 1)
2. 定义dp[i][j]:i+1位数,并且以j为最高位的“步进数字”个数
状态转移:dp[i][j] = dp[i-1][j-1] + dp[i-1][j+1];边界特殊考虑
3. f(x)实现思路:
a. 从高位向低位枚举x,假设最高位为h,当前位为i,值为v[i]
b. 每枚举一位,我们便加上位数为i的所有"步进数字",即dp[i][1...9],如果当前位是最高位,则为dp[h][1...(v[h]-1)]
c. 对于dp[h][v[h]],包含了小于x的"步进数字"、x和大于x的"步进数字",统计dp[h][v]中小于x的"步进数字"方法如下:每枚举一位,便考虑h到(i+1)位均与x相同且小于x的"步进数字"个数,若h到(i+1)位不满足"步进数字"要求则忽略;若满足,则考虑当前位为v[i+1]-1和v[i+1]+1时是否小于x,若也满足,则加上dp[i][v[i+1]-1]和dp[i][v[i+1]+1]
d. 最后若x是“步进数字”则+1
维护dp[i][j]的时间复杂度为O(10 * n);f(x)计算的时间复杂度是O(n)
总的时间复杂度O(n)
代码示例:
class Solution {
public:
#define MOD 1000000007
using ll = long long;
ll dp[100][10];
void Init(int n) {
fill_n(&dp[0][0], 10, 1);
for (int i = 1; i < n; ++i) {
dp[i][0] = dp[i - 1][1];
dp[i][9] = dp[i - 1][8];
for (int j = 1; j < 9; ++j) (dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j + 1]) %= MOD;
}
}
ll Solve(string_view str, int u, bool f) {
if (u == 0) return str.size() > 1 ? 10 + f : str[u] - '0' + 1;
ll res = 0;
for (int i = 1; i < (u == str.size() - 1 ? str[u] - '0' : 10); i++) res += dp[u][i];
res += Solve(str, u - 1, (str[u - 1] != str[u] + 1 && str[u - 1] != str[u] - 1) ? false : f);
if (f && str[u] != '0' && str[u] - 1 < str[u - 1]) res += dp[u - 1][str[u] - '1'];
if (f && str[u] + 1 < str[u - 1]) res += dp[u - 1][str[u] - '0' + 1];
return res % MOD;
}
int countSteppingNumbers(string low, string high) {
Init(high.size());
reverse(low.begin(), low.end());
reverse(high.begin(), high.end());
int i = 0;
while (low[i] == '0') ++i;
--low[i--];
while (i >= 0) low[i--] = '9';
while (low.size() > 1 && low.back() == '0') low.pop_back();
return (Solve(high, high.size() - 1, true) - Solve(low, low.size() - 1, true) + MOD) % MOD;
}
};