Given an integer n, return the number of digits in its decimal representation. Treat negative numbers as if the minus sign were not there (e.g., -123 has 3 digits). The number 0 has exactly 1 digit. You must compute this recursively without loops.
Input: A single integer n.
Output: Return an integer representing the digit count.
Input: 12345
Output: 5
Explanation: Five digits: 1,2,3,4,5.Input: 0
Output: 1
Explanation: Zero is a single digit.Input: -987
Output: 3
Explanation: Sign is ignored; 987 has 3 digits.-10^9 <= n <= 10^9