386. Lexicographical Numbers

386. Lexicographical Numbers

Given an integer n, return all the numbers in the range [1, n] sorted in lexicographical order.

You must write an algorithm that runs in O(n) time and uses O(1) extra space.

Example 1:

Input: n = 13
Output: [1,10,11,12,13,2,3,4,5,6,7,8,9]

Example 2:

Input: n = 2
Output: [1,2]

class Solution {
    List<Integer> res;
    public List<Integer> lexicalOrder(int n) {
        res = new ArrayList<>();
        //首位数不可能为0
        for (int i = 1; i <= 9; ++i) {
            dfs(i, n);
        }
        return res; 
    }
    private void dfs(int cur, int n) {
        if (cur > n) return;
        res.add(cur);
        for (int i = 0; i <= 9; ++i) {
            //向左递归 剪纸
            int nextNumber = cur * 10 + i;
            if (nextNumber > n) break;
            dfs(nextNumber, n);
        }
    }
}