12.8.4-PointersOnC-20220402

 

#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 CountShowList(Node **p);//12.8.1计数+显示
Node *Search(Node **p,char *str);//12.8.2查找
Node *Reverse(Node *p);//12.8.4反序
int main(){
	char input[LENWORD]={};
	Node *plist=NULL;
	Node *ptemp=NULL;
	ClearList(&plist);
	for(fputs("Input the word:->",stdout);AddList(&plist)==1;fputs("Input the word:->",stdout));
	printf("Count=%d\n",CountShowList(&plist));
	for(fputs("Input the string to search:->",stdout);
		my_fgets(input,LENWORD)&&*input;
		fputs("Found ",stdout),fputs((ptemp=Search(&plist,input))?"It!\n":"Nothing!\n",stdout),fputs("Input the string to search:->",stdout));

	plist=Reverse(plist);
	printf("Count=%d\n",CountShowList(&plist));

	ClearList(&plist);
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 *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(;(pcall->link=*p)&&strcmp(input,pcall->link->value)>=0;p=&pcall->link->link);
	*p=pcall;
return 1;}

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

Node *Search(Node **p,char *str){
	for(;*p&&strcmp((*p)->value,str);p=&((*p)->link));
return *p;}

Node *Reverse(Node *p){
	Node *current=NULL,*previous=NULL;
	for(;current=p;){
		p=p->link;
		current->link=previous;
		previous=current;
	}
return previous;}