1.题目
Given an integer n, return 1 - n in lexicographical order.
For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].
Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000.
2.解答
class Solution {
public List<Integer> lexicalOrder(int n) {
// 思路:典型的桶排序,分为1-9个桶,每个桶再依次按照递归的方式排序,最后输出的时候按照树的先序遍历
List<Integer> list=new ArrayList<>();
for(int i=1;i<=9;i++){
helper(i,n,list);
}
return list;
}
public void helper(int curRootNum,int maxNum,List<Integer> list){
if(curRootNum>maxNum){
return ;
}
list.add(curRootNum);
for(int i=0;i<=9;i++){
int nextCurRootNum=curRootNum*10;
if(nextCurRootNum>maxNum){
return;
}
helper(nextCurRootNum+i,maxNum,list);
}
}
}