单链表查找第i个节点

 #include<stdio.h>
 #include<string.h>
 #include<stdlib.h>
 typedef struct Node
 {
     char a;
     struct Node* next;
 }Node,*list;
 void p(list L)
 {
     Node *s;
     char c;
     int f=;
     while(f)
     {
         c=getchar();
          if(c!='$')
         {
             getchar();
              s=(Node*)malloc(sizeof(Node));
              s->a=c;
                 s->next=L->next;
               L->next=s;
         }
         else
             f=;
     }
 }
 Node *get(list L,int i)
 {
     int j=;
     list p;
     p=L;
     if(i<)
         return ;
     while((p->next!=NULL)&&(j<i))
     {
         p=p->next;
         j++;
     }
     if(i==j)
          return p;
     else
         return ;
 }
 int main()
 {
     list L,s;
     L=(Node*)malloc(sizeof(Node));
     L->next=NULL;
     p(L);
     s=L->next;
     while(s->next!=NULL)
     {
         printf("%c ",s->a);
         s=s->next;
     }
     printf("%c\n",s->a);
     int n;
     scanf("%d",&n);
     Node *r;
     r=(Node*)malloc(sizeof(Node));
     if(get(L,n)!=NULL)
     {
         r=get(L,n);
         printf("%c\n",r->a);
     }
     return ;
 }