java-coding-ninjas/recursion1/NumberOfDigit.java at master · avinashbest/java-coding-ninjas · GitHub

34 lines (31 loc) · 799 Bytes

package recursion1;

import java.util.Scanner;

/*Given the code to find out and return the number of digits present in a number recursively. But it contains few bugs, that you need to rectify such that all the test cases should pass.

Input Format :

Integer n

Output Format :

Count of digits

Constraints :

1 <= n <= 10^6

Sample Input 1 :

156

Sample Output 1 :

Sample Input 2 :

Sample Output 2 :

1*/

public class NumberOfDigit {

public static int numberOfDigit(int n) {

if (n == 0) {

return 0;

}

int smallAnswer = numberOfDigit(n / 10);

return smallAnswer + 1;

}

public static void main(String[] args) {

Scanner scan = new Scanner(System.in);

int n = scan.nextInt();

System.out.println(numberOfDigit(n));

}

java-coding-ninjas/recursion1/NumberOfDigit.java at master · avinashbest/java-coding-ninjas · GitHub

Expand file tree

Breadcrumbs

NumberOfDigit.java

Latest commit

History

Breadcrumbs

NumberOfDigit.java

File metadata and controls