关于二分法的编程题，求大佬指点

Question

Answer 1

function getNum(k){
    //  个位    十位      百位
    // 9 * 1 + 90 * 2 + 900 * 3 + ...
    let b = 0, start, end = 0
    do{
        start = end
        end += 9 * (10 ** b) * (b + 1)
        b++
    }while(k > end)

    let num = Math.ceil((k - start) / b) + 10 ** (b - 1) - 1
    let index = (k - start - 1) % b
    console.log(num, index)
    return String(num)[index]
}

Answer 2

function nth1(n) {
  let s = "";
  let c = 1;
  while (1) {
    s += c++;
    if (s.length >= n) return s[n - 1];
  }
}

function nth2(n) {
  const nine = 9;
  let sum = 0;
  let dist = 0;
  let len = 0;
  while (1) {
    sum += nine * len;
    dist += nine;
    if (sum >= n) {
      sum -= nine * len;
      dist -= nine;
      n -= sum;
      break;
    }
    nine *= 10;
    len++;
  }
  const diff = Math.ceil(n / len);
  const d = n % len || len;
  return (dist + diff + "").charAt(d - 1);
}