Recursion Lab $3$

Write a recursive method called digitCount$()$ that takes a non$-$negative

integer as a parameter and returns the number of digits in the integer.

Hint: The digit count increases by $1$ whenever the input number is

divided by $10.$

Enter an integer: $345$

Digits: $3$

You must use recursion. This is not a string manipulation problem.

Although it could be solved with string manipulation, you must solve

this recursively.

Starter Code:

import java.util.Scanner;

public class LabProgram $\{$

$/*$ TODO: Write recursive digitCount$()$ method here. $*/$

public static void main$($String$[]$ args$)\{$

Scanner scnr $=$ new Scanner$($System$.$in$)$;

int num, digits;

num $=$ scnr$.$nextInt$()$;

digits $=$ digitCount$($num$)$;

System.out.println$($digits$)$;

$\}$

$\}$