链接:https://leetcode-cn.com/problems/lexicographical-numbers/](https://leetcode-cn.com/problems/lexicographical-numbers/)
这道题实际就是一个十叉树的深度优先搜索。
java代码:
class Solution {
List<Integer>res = new ArrayList();
public List<Integer> lexicalOrder(int n) {
dfs(n,0);
return res;
}
private void dfs(int n,int begin)
{
if(begin>n)
return;
for(int i = begin;i<begin+10;i++)
{
if(i<=n&&i!=0)
{
res.add(i);
dfs(n,i*10);
}
}
}
}