#440

gistfile1.txt

class Solution {
public:
    int findKthNumber(int n, int k) {
        long long node = 1;
        for (int i = 1; i <= k; i++) {
            if (i == k) {
                return node;
            }

            if (node * 10 <= n) {
                node *= 10;
            } else {
                while ((node % 10 == 9 || node + 1 > n) && node > 0) {
                    node /= 10;
                }
                node++;
            }
        }
        return -1;
    }
};