[数据结构与算法]12.3-PointersOnC-20220331

单链表

按照教材的二级指针法

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define LENWORD 11
typedef struct node{
	struct node *link;
	char value[LENWORD];
}Node;

char *my_fgets(char *p,int n);
int ClearList(Node **p);
int AddList(Node **p);
int ShowList(Node **p);
int main(){
	Node *root=NULL;
	ClearList(&root);
	for(fputs("Input the word:->",stdout);AddList(&root)==1;fputs("Input the word:->",stdout));
	ShowList(&root);
	ClearList(&root);
return 0;}
//
char *my_fgets(char *p,int n){
	char ch=0,*input=NULL,*found=NULL;
	if(input=fgets(p,n,stdin))
		if(found=strchr(input,10)) *found=0;
		else while((ch=getchar())!=EOF&&ch!=10);
return input;}

int ClearList(Node **p){
	if(*p) for(Node *ptemp=NULL,*pcopy=*p;ptemp=pcopy;pcopy=pcopy->link,free(ptemp));
	else return 0;
return 1;}

int AddList(Node **p){
	Node *ptemp=NULL,*pcall=NULL;
	char input[LENWORD]={};
	if(!my_fgets(input,LENWORD)||!*input) return 0;
	if(!(pcall=(Node *)calloc(1,sizeof(Node)))) return -1;
	strcpy(pcall->value,input);
	for(;(ptemp=*p)&&strcmp(input,ptemp->value)>=0;p=&ptemp->link);
	pcall->link=ptemp;
	*p=pcall;
return 1;}

int ShowList(Node **p){
	if(!*p) return 0;
	for(int i=0;*p;printf("NO.%d:",i+++1),fputs((*p)->value,stdout),fputc(10,stdout),p=&(*p)->link);
return 1;}