Problema
Count how many decimal digits n has when written normally, without leading zeros.
Implement count_digits(n).
Input
n: A positive integer.
Output
Return the number of digits.
Restricciones
1 ≤ n ≤ 10¹⁸
Ejemplos
Entrada:
n = 352
Salida esperada:
expected = 3
Entrada:
long long n = 352;
Salida esperada:
long long expected = 3;
Entrada:
long n = 352;
Salida esperada:
long expected = 3;
Explicación
352 has three digits.
Entrada:
n = 7
Salida esperada:
expected = 1
Entrada:
long long n = 7;
Salida esperada:
long long expected = 1;
Entrada:
long n = 7;
Salida esperada:
long expected = 1;
Explicación
A single digit.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
You only need to know how many times you can remove a digit before nothing remains.
Pista 2
A loop with division by 10 or a string length both work well.
Pista 3
Don’t forget that any positive single-digit number still has exactly one digit.
Complejidad esperada
O(d) time, O(1) extra space