digit using recursion Java

Sign in to answer this question.

• 

  Elavarasan R7y agoPosted Aug 1, 2019, 12:57 AM

  Hello majid Ali,

   

  To try below codes thats partially reach your solution. then click on referece you will get what you need.

  1. import java.util.Scanner;  
  2. public class Count_Occurrence  
  3. {  
  4.     public static void main(String[] args)   
  5.     {  
  6.         int n, x, count = 0, i = 0;  
  7.         Scanner s = new Scanner(System.in);  
  8.         System.out.print("Enter no. of elements:");  
  9.         n = s.nextInt();  
  10.         int a[] = new int[n];  
  11.         System.out.println("Enter the elements:");  
  12.         for(i = 0; i < n; i++)  
  13.         {  
  14.             a[i] = s.nextInt();  
  15.         }  
  16.         System.out.print("Enter the element of which you want to count occurrences:");  
  17.         x = s.nextInt();  
  18.         for(i = 0; i < n; i++)  
  19.         {  
  20.             if(a[i] == x)  
  21.             {  
  22.                 count++;  
  23.             }  
  24.         }  
  25.         System.out.println("Number of Occurrence:"+count);  
  26.     }  
  27. } 
      

   Reference

   https://www.sanfoundry.com/java-program-count-number-occurrence-array-elements/
  https://www.geeksforgeeks.org/count-occurrences-of-a-substring-recursively/