386. Lexicographical Numbers

description of problem

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. 

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/lexicographical-numbers

Chinese version

给你一个整数 n ，按字典序返回范围 [1, n] 内所有整数。

你必须设计一个时间复杂度为 O(n) 且使用 O(1) 额外空间的算法。

Example

输入：n = 13
输出：[1,10,11,12,13,2,3,4,5,6,7,8,9]

The summit results

The codes for this problem

#include <vector>
#include <iostream>

using namespace std;
class Solution {
public:
    //given an integer n, return all the numbers in the range [1, n] sorted in lexicographical order.
    vector<int> lexicalOrder(int n) {
        vector<int> res;
        for(int i = 1; i <= 9; i++)
            dfs(i, n, res);
        return res;
    }
    void dfs(int cur, int n, vector<int>& res) {
        if(cur > n) return;
        res.push_back(cur);
        for(int i = 0; i < 10; i++)
            dfs(cur * 10 + i, n, res);
    }
};


int main()
{
    Solution s;
    vector<int> res = s.lexicalOrder(53);
    for (int i = 0; i < res.size(); i++) {
        cout << res[i] << " ";
    }
    cout << endl;
    return 0;
}

The corresponding results:

1 10 11 12 13 14 15 16 17 18 19 2 20 21 22 23 24 25 26 27 28 29 3 30 31 32 
33 34 35 36 37 38 39 4 40 41 42 43 44 45 46 47 48 49 5 50 51 52 53 6 7 8 9