#include<stdio.h>
#include<stdlib.h>
#define LEN sizeof(NODE)


typedef struct node
{
    int a;
    struct node*next;
}NODE;

NODE* creat()
{
    int n=0;
    NODE*head=NULL;
    NODE*p1=NULL;
    NODE*p2=NULL;
    p1=p2=(NODE*)malloc(LEN);
    printf("enter\n");
    scanf("%d",&p1->a);
    while(p1->a != 0)
    {
        n++;
        if(n==1)head=p1;
        else
        {
            p2->next=p1;
            p2=p1;
            p1=(NODE*)malloc(LEN);
            scanf("%d",&p1->a);
        }
     } 
     p2->next=NULL;
     return head;     
}

NODE* del(int n,NODE*p)
{
    int k;
    NODE*q=NULL;
    NODE*head=NULL;
    head=p=q;
    for(k=0,head=p;k<n-1,p!=NULL;)//查找第n个节点 
    {
        p=p->next;
        k++;
    }
    q=p->next;                    //q成为要删除的节点 
    p->next=q->next;
    free(q);
    return head;
}


void print(NODE*p2)
{
    printf("%d",p2->a);
    p2=p2->next;
}
int main()
{
    NODE*p1=NULL;
    NODE*p2=NULL;
    p1=creat();
    int n;
    printf("enter\n");
    scanf("%d",&n);
    p2=del(n,p1);
    printf("print\n");
    print(p2);
}

链表的创建是没有问题的，删除的那一部分有问题。

#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int a;
    struct node* next;
}NODE;

NODE* creat()
{
    int n=0,x;
    NODE* head=NULL;
    NODE* p1=NULL;
    NODE* p2=NULL;
   
    printf("建立链表\n");
    scanf("%d",&x);
    while(x!= 0)
    {
        p1=(NODE*)malloc(sizeof(NODE)*1);
        p1->a=x;
        n++;
        if(n==1){
            head=p1;
            p2=p1;
        }
        else
        {
            p2->next=p1;
            p2=p1;
        }
        scanf("%d",&x);
     }
     p2->next=NULL;
     return head;     
}

NODE* del(int n,NODE* p)
{
    int k;
    NODE* q=NULL;
    NODE* head=NULL;
    head=p;
    q=p;
    if(n==1){       //删除第一个节点
    p=p->next;
    head=p;
    return head;
    }
    for(k=0;k<n-2;k++)//查找第n个节点  
            p=p->next;
            
    if(p->next->next==NULL){          //如果想删最后一个节点
       q=p;
       q->next=NULL;
        p=p->next;
        free(p);
        return head;
    }
        
    q=p->next;                    //q成为要删除的节点
    p->next=q->next;
    free(q);
    return head;
}


void print(NODE* p2)
{
    do{
        printf("%d",p2->a);
    p2=p2->next;
    }while(p2!=NULL);
   
}
int main()
{
    NODE* p1=NULL;
    NODE* p2=NULL;
    p1=creat();
    int n;
    printf("输入删除节点位置\n");
    scanf("%d",&n);
    p2=del(n,p1);
    printf("print\n");
    print(p2);
    return 0;
}

感觉删除节点用双向链表效率会更高，直接知道节点的ID就行了~单向的话直接知道ID还需要往前搜一遍，当然，看题目和具体环境以及个人兴趣咯~

#include "stdio.h"
#include "stdlib.h"
#define LEN sizeof(NODE)
typedef struct node
 { int a;
     struct node *next;
 }NODE;
 NODE *creat()
  {
      NODE *p1,*p2,*head;
      head=(NODE *)malloc(LEN);
      p1=p2=(NODE *)malloc(LEN);
      head->next=p1;
      scanf("%d",&p1->a);
      while(p1->a!=0)
       {  p1=(NODE *)malloc(LEN);
           p2->next=p1;
           scanf("%d",&p1->a);
           p2=p1;
       }
       p2->next=NULL;
       return head;
  }
 int print(NODE *head)
  { NODE *p1,*p2;
      p1=head->next;
      printf("head->%d",p1->a);
    p1=p1->next;
      while(p1->next)
       { printf("->%d",p1->a);
            p1=p1->next;
       }
       printf("->end");
       return 0;
  }
  NODE *del(int n,NODE *head)
   { int k;
        NODE *p,*q;
        for(k=0,p=head;k!=n-1;k++) p=p->next;
        q=p->next;
        p->next=q->next;
        free(q);
        return head;
   }
  int main()
   { int n;
        NODE *head,*p1;
        head=creat();
        print(head);
        printf("\n\n input a number: ");
        scanf("%d",&n);
        head=del(n,head);
        print(head);
        printf("\n\n");
        return 0;
   }

收到的鲜花

• bjut_Allen 于 2017-01-10 09:18 送鲜花  10朵   附言：我很赞同