leetcode

0 class Solution {

1 public:

2 vector<int> lexicalOrder(int n) {

3 vector<int> res(n);

4 int cur = 1;

5 for (int i = 0; i < n; i++) {

6 res[i] = cur;

7 if (cur * 10 <= n)

8 cur *= 10;

9 else {

10 if (cur >= n) cur /= 10;

11 cur += 1;

12 while (cur % 10 == 0)

13 cur /= 10;

14 }

15 }

16 return res;

17 }

18 };