Number of Digits- Recursion

Number of Digits

Given the number 'n', find out and return the number of digits present in a number recursively.
Input Format :
Integer n
Output Format :
Count of digits
Constraints :
1 <= n <= 10^6
Sample Input 1 :
 156
Sample Output 1 :
3
Sample Input 2 :
 7
Sample Output 2 :
1


****************************Code*******************************

public class Solution {

	public static int count(int n){
		
		if(n/10==0)
		{
			return 1;
		}
		return 1+count(n/10);
	}

}