本文共 931 字，大约阅读时间需要 3 分钟。

???1?n???k??????????????????????????????????????????????????

??????????????????????????????????????????

?????

public int findKthNumber(int n, int k) {    int cur = 1;    k--; // ????????1    while (k > 0) {        long long step = 0, first = cur, last = cur + 1;        while (first <= n) {            step += (last <= n) ? (last - first) : (n - first + 1);            first *= 10;            last *= 10;        }        if (step <= k) {            cur++;            k -= step;        } else {            cur *= 10;            k--;        }    }    return cur;}

???

• ???????1???k??0?????????1??
• ?????k>0????
• ??????????????????????????steps?
• ?????????????k???????????????????????
• ?????????????????k????????????????
• ????k??0?????????

???????????????????????????n??????

转载地址：http://giki.baihongyu.com/