연결된 목록에서 숫자의 발생.

단계:

#include <stdio.h>
#include <stdlib.h> 

struct node
{
   int data;
   struct node * next;
};  

void displayLL(struct node * head)
{
   int num = 0;
   struct node * temp;
   temp = head;
   temp=head;
   while(temp!=0)
   {
       printf("%d ",temp->data);
       temp = temp->next;
       num++;
   }
}

void occurrence(struct node *head)
{
   struct node *temp = head;
   int item, count = 0;
   printf("\nEnter the number whose occurrence is to find : ");
   scanf("%d", &item);

   while(temp != NULL)
   {
       if(temp->data == item)
           count++;
           temp = temp->next;
   }
   printf("Occurrence of number  %d : %d", item, count);
}

int main()
{
   struct node *head = 0, *newnode, *temp, *slow; 
   int n, choice, newdata;

// Create Linked List //

   printf("Enter the number of nodes in the list : ");
   scanf("%d", &n);
   for(int i = 1; i<=n; i++)
   {
   newnode = (struct node *)malloc(sizeof(struct node));
   printf("Enter the data%d : ", i);
   scanf("%d", &newnode->data);
   newnode->next = 0;
   if(head == 0)
    {
        head = temp = newnode;
    } 
    else
       { 
        temp->next = newnode;
        temp = newnode;
       }
 }
   printf("--------------------------------\n");
   printf("Linked list : ");
   displayLL(head);
   occurrence(head);
}