#include <stdio.h>
#include <stdlib.h>
typedef struct Lnode
{
    int data;
    struct Lnode *next;
}Lnode,*LinkList;

main()
{
    LinkList h,p,q;
    int i,num;
    int n=10;
    h=(LinkList)malloc(sizeof(Lnode));
    p=q=h;
    for(i=0;i<n;i++)
    {
        p=(LinkList)malloc(sizeof(Lnode));
        scanf("%d",&p->data);
        q->next=p;
        q=p;
    }
    q->next=NULL;
         printf("Please input the deleted number");
    scanf("%d",&num);
    p=h;
    while(p->next&&p->next->data!=num)
    {      
      
        //q=p;
             p=p->next;
    }
    if(!p->next)
        printf("Not found！");
    else
         {
             p->next=p->next->next;
    
          }
         for(p=h;p->next!=NULL;p=p->next)
        printf("%d",p->next->data);   
}

[[it] 本帖最后由 liyanhong 于 2008-10-22 23:01 编辑 [/it]]

#include <stdio.h>
#include <stdlib.h>
typedef struct Lnode
{
    int data;
    struct Lnode *next;
}Lnode,*LinkList;

void main()
{
    LinkList h,p,q;
    int i,num,k=1;
    int n=3;
    h=(LinkList)malloc(sizeof(Lnode));
    p=q=h;
    for(i=0;i<n;i++)
    {
        p=(LinkList)malloc(sizeof(Lnode));
        scanf("%d",&p->data);
        q->next=p;
        q=p;
    }
     p->next=NULL;
     printf("Please input the deleted number\n");
    scanf("%d",&num);
    p=h;
   while(p->next->next)
   {
       q=p->next;
       if(q->data==num)
       {
           p->next=q->next;
       }
       else
           p=p->next;
   }
   for(p=h->next;p!=NULL;p=p->next)
       printf("%d",p->data);
}

不好意思重发一次,删除值为NUM的元素
#include <stdio.h>
#include <stdlib.h>
typedef struct Lnode
{
    int data;
    struct Lnode *next;
}Lnode,*LinkList;

void main()
{
    LinkList h,p,q;
    int i,num,k=1;//
    int n=10;
    h=(LinkList)malloc(sizeof(Lnode));
    p=q=h;
    for(i=0;i<n;i++)
    {
        p=(LinkList)malloc(sizeof(Lnode));
        scanf("%d",&p->data);
        q->next=p;
        q=p;
    }
    p->next=NULL;
    printf("Please input the deleted number");
    scanf("%d",&num);
    p=h;
   while(p->next->next)
   {
       q=p->next;
       if(q->data==num)
       {
           p->next=q->next;//
           k=0;////
       }
       else
           p=p->next;
   }
   if(k)//
       printf("Not found！");
   else
   {
    for(p=h->next;p!=NULL;p=p->next)//
       printf("%d",p->data);//
   }
}

感谢 二楼的回复

哈哈  求人不如求己