字典序的第K小数字

题目

题源

代码

码源

class Solution {

    public int findKthNumber(int n, int k) {
        long cur = 1;
        k -= 1;

        while(k > 0){
            int nodes = getNodes(n, cur);
            // 当前节点的总数小于要查找的第k位，则右移
            if(k >= nodes){
                k -= nodes;
                cur++;      //go right
            }else{
                k -= 1;
                cur *= 10;  //go down
            }
        }

        return (int)cur;
    }
    // 获取当前节点的所构成子树的节点个数
    private int getNodes(int n, long cur) {
        long next = cur + 1;
        long totalNodes = 0;
        
        while(cur <= n) {
            totalNodes += Math.min(n - cur + 1, next - cur);

            next *= 10;
            cur *= 10;
        }

        return (int)totalNodes;
    }
}