leetcode 386. 字典序排数 给定 n =1 3，返回 [1,10,11,12,13,2,3,4,5,6,7,8,9] 直接模拟10叉树

题目

class Solution {
public:
    vector<int> lexicalOrder(int n) {
        vector<int>ans;
        int cnt=0,now=1;
        if(cnt<n) ans.push_back(now),++cnt;
        while(cnt<n){//已经放入了cnt个
            if(now*10<=n) now*=10;
            else{
                while(now%10==9||now==n) now/=10;
                ++now;
            }
            ans.push_back(now),++cnt;
        }
        return ans;
    }
};

class Solution {
public:
    vector<int> lexicalOrder(int n) {
        vector<int>ans;
        int cnt=0,now=1;
        if(cnt<n) ans.push_back(now),++cnt;
        while(1){//已经放入了cnt个
            if(now*10<=n) now*=10;
            else{
                while(now%10==9||now==n) now/=10;
                if(!now) break;//这样也是对的......
                ++now;
            }
            ans.push_back(now),++cnt;
        }
        return ans;
    }
};