#include<stdio.h>
#include<stdlib.h>
typedef struct LNode
{
int data;
struct LNode *next;
}LNode,*LinkList;
int InitList(LinkList &L)
{
L=(LinkList)malloc(sizeof(LNode));
if(L==NULL)
return false;
L->next=NULL;
return true;
}
int chucun (LinkList L,int a[],int i)
{
LinkList s;
while(i<5)
{
s=(LinkList)malloc(sizeof(LNode));
s->next=NULL;
L->data=https://bbs.csdn.net/topics/a[i];
s->next =L->next;
L->next=s;s->data=https://bbs.csdn.net/topics/L->data;
i++;
}
}
LinkList charu(LNode * L,int c)
{
LinkList p; int j=0,i=2;
p=L;
while(j<i-1)
{
p=p->next;++j;
}
LinkList s;
s=(LinkList)malloc(sizeof(LNode));
s->data=https://bbs.csdn.net/topics/c;s->next=p->next;
p->next=s;
return L->next;
}
int shanchu (LinkList L, int i){
LinkList p,s;
int j=0;
p=L;
while(!(p->next)&&j<i-1){
p=p->next,j++;}
s=p->next;
p->next=s->next;
free(s);
s=NULL;
}
void printlist(LinkList L){
LinkList temp=L;
printf("鏈表中的值為\n");
while(temp){
temp=temp->next;
printf("%d\n",temp->data);}
}
int main(){
LinkList L;
InitList(L);
int a[]={11,22,33,44,66};
int i=0;
int c=55;
chucun(L, a, i);
printf("列印儲存的鏈表\n");
printlist(L);
charu (L,c);
printf("列印插入的鏈表\n");
printlist(L);
shanchu (L ,5);
printf("列印洗掉后的鏈表\n");
printlist(L);
}
uj5u.com熱心網友回復：
#include<stdio.h>
#include<stdlib.h>
typedef struct LNode
{
int data;
struct LNode *next;
}LNode,*LinkList;
int InitList(LinkList &L)
{
L=(LinkList)malloc(sizeof(LNode));
if(L==NULL)
return false;
L->next=NULL;
return true;
}
//store
//int chucun (LinkList L,int a[],int i)
int chucun (LinkList L,int a[], int len)
{
int i = 0;
LinkList s;
while(i < len)
{
s = (LinkList)malloc(sizeof(LNode));
if (!s)
return -1;
s->data = a[i];
s->next = L->next;
L->next = s;
/*s->next=NULL;
L->data=https://bbs.csdn.net/topics/a[i];
s->next =L->next;
L->next=s;s->data=https://bbs.csdn.net/topics/L->data;
*/
i++;
}
return 0;
}
LinkList charu(LNode * L, int pos, int c)
{
LinkList p;
int j=0,i=2;
p=L;
while(j < pos - 1 && p->next)
{
p=p->next;++j;
}
LinkList s;
s=(LinkList)malloc(sizeof(LNode));
s->data=https://bbs.csdn.net/topics/c;
s->next=p->next;
p->next=s;
//return L->next;
return L;
}
int shanchu (LinkList L, int i)
{
LinkList p,s;
int j=0;
p=L;
//while(!(p->next)&&j<i-1){
while((p->next)&&j<i-1){
p=p->next,j++;
}
if (p->next == NULL)
return -1;
s = p->next;
p->next=s->next;
free(s);
s=NULL;
return 0;
}
void printlist(LinkList L)
{
LinkList temp = L->next;
printf("鏈表中的值為\n");
while(temp) {
printf("%d\n",temp->data);
temp=temp->next;
}
}
//int main()
int main(void)
{
LinkList L;
InitList(L);
int a[]={11,22,33,44,66};
int i=0;
int c=55;
chucun(L, a, sizeof(a)/sizeof(a[0]));
printf("列印儲存的鏈表\n");
printlist(L);
charu (L, 2, c);
printf("列印插入的鏈表\n");
printlist(L);
shanchu (L ,5);
printf("列印洗掉后的鏈表\n");
printlist(L);
return 0;
}
供參考～
uj5u.com熱心網友回復：
找到錯誤了，謝謝大佬
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/272981.html
標籤：C語言