链表插入删除

p =q;
}
}
//插入一个元素
void insert_list(LNode *head,int x,int i )
{
int j=0;
LNode *p,*s;
p=head;
while((p!=NULL)&&(j<i-1))
{
p=p->next;
j++;
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
struct node /*节点的数据结构*/
{
int num;
char str[20];
struct node *next;
};
main( )
void print(struct node *head);
struct node *head;
char str[20];
int n;
head=NULL; /*做空表*/
head=creat(head); /*调用函数创建以head 为头的链表*/
print(head);/*调用函数输出节点*/
{
printf("%d ",p->data);
p=p->next;
}
printf("\n*****************************************************\n");
printf("x=");scanf("%d",&x);
printf("\ninsert i=");scanf("%d",&i);
main()
{
LNode *head,*p;
int n;
int x,i;
int b;
clrscr();
head=creat_head();
printf("n=");scanf("%d",&n);
creat_list(head,n);
for(p=head->next;p!=NULL;)
getcLNode *creat_head()
{
LNode *p;
p=(Llist)malloc(sizeof(LNode));
p->next=NULL;
return(p);
}
//创建一个长度为n的线性链表
void creat_list(LNode *head,int n)
{
LNode *p,*q;
int i;
p=head;
for(i=1;i<=n;i++)
{
q=(Llist)malloc(sizeof(LNode));
printf("data:");scanf("%d",&q->data);
q->next=NULL;
p->next=q;
printf("\n input inserted num,name:\n");
gets(str); /*输入学号*/
n=atoi (str);
gets(str); /*输入姓名*/
head=insert(head, str, n); /*将节点插入链表*/
print (head); /*调用函数输出节点*/
gets(temp ) ;
gets(p1->str);
p1->num=atoi (temp);
p1->next = NULL;
}
return head;
}
/* * * * * * * * * * * * * * * * * * * */
/* * * * * * * * * * 插入节点* * * * * * * * * */
printf("delete i=");scanf("%d",&i);
b=delete_list(head,i);
for(p=head->next;p!=NULL;)
{
printf("%d ",p->data);
p=p->next;
}
printf("\ndelete b=%d",b);
struct node *insert (struct node *head, char *pstr, int n)
{
struct node *p1,*p2,*p3;
p1=(struct node*)malloc(sizeof(struct node));
strcpy (p1->str, pstr);
{
p = temp;
temp = temp->next;
}
if (strcmp(temp->str , pstr ) == 0 )
{
if (temp== head)
{
head = head->next ;
free(temp) ;
}
else
{
p->next =temp->next;
}
/* * * 创建链表* * * * * * * * * * * */
struct node *creat(struct node *head)
{
char temp[30];
struct node *p1,*p2;
p1 = p2=(struct node*) malloc(sizeof(struct node));
{
LNode *p,*q;
int j=0;
int x;
p=head;
while((p!=NULL)&&(j<i-1))
{
p=p->next;
j++;
}
if(p==NULL) exit(0);
q=p->next;
p->next=q->next;
}
}
return (head) ;
}
/* * * * * * * * * * * * * * * * * * * * * * * * */
/* * * * * 删除节点* * * * * * * * * * * * */
struct node *delet (struct node *head, char *pstr)
p1->num = n ;
p2 = head ;
if ( head == NULL )
{
head = p1 ; p1->next = NULL ;
}
else
{
while (n>p2->num&&p2->next!=NULL)
{
p3 = p2;
p2 = p2->next;
{
struct node *temp,*p;
temp = head ;
if (head==NULL)
printf("\nList is null!\n");
else
{
temp = head ;
while (strcmp(temp->str,pstr)!=0&&temp->next!=NULL)
{
/*函数声明*/
struct node* creat(struct node *head);
struct node* insert(struct node *head, char *pstr, int n);
struct node* delet(struct node *head, char *pstr);
/* * * * * * * * * * 链表各节点的输出* * * * * * * * * */
void print (struct node *head)
{
struct node *temp;
temp =head ;
printf("\n output strings:\n");
printf ("input num, name: \n;");
printf("exit:double times Enter!\n");
gets(temp) ;
gets(p1->str);
p1->num=atoi (temp);
p1->next =NULL;
while (strlen(p1->str)>0)
C语言 数据结构中的链表创建，插入和删除代码
#include<stdio.h>
#include<stdlib.h>
//declaration
typedef struct LNode
{
int data;
struct LNode *next;
}LNode,*Llist;
x=q->data;
free(q);
return(x);