链接:https://leetcode-cn.com/problems/lexicographical-numbers/
class Solution {
public:
vector<int> lexicalOrder(int n) {
vector<int> result;
lexical_order(0, n, &result);
return result;
}
void lexical_order(int level_value, int n, vector<int>* result) {
if (level_value > n) return;
if (level_value != 0) {
result->push_back(level_value);
}
for (int i = 0; i <= 9; ++i) {
int value = 10*level_value+i;
if (value != 0 && value <= n) {
// 下一层
lexical_order(value, n, result);
}
}
}
};