20230207 作业

作业

1 有序单链表，随机输入几个无序单字符，输出升序结果

2 单向链表，实现‘b’-'h’字符的逆置

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

typedef struct Node{
	char data;
	struct Node *next;
}Node,*Link;

void show(Link head){
	Link node = head->next;
	while(node){
		printf("%c",node->data);
		node = node->next;
	}
	printf("\n");
}

Link apply(){
	Link node = (Link)malloc(sizeof(Node));
	return node;
}

void *freeLink(Link link){
	while(link){
		Link t = link;
		link = link->next;
		free(t);
		t = NULL;
	}
	return NULL;
}

int insertOne(Link head,char c){
	Link one = apply();
	if(one == NULL)
		return 0;
	one->data=c;
	Link node = head;
	while(node->next!=NULL && node->next->data < one->data){
		node = node->next;
	}
	one->next = node->next;
	node->next = one;
	return 1;
}
void reverse(Link head){
	if(head == NULL || head->next == NULL){
		return;
	}
	Link node = head->next;
	head->next = NULL;
	while(node){
		Link p = node;
		node = node->next;

		p->next = head->next;
		head->next = p;
	}
}
int main(int argc, const char *argv[])
{
	Link head= apply();
	if(head == NULL){
		printf("链表创建失败!\n");
		return -1;
	}
	char c[100] = "";
	printf("请随机输入几个字符:");
	scanf("%s",c);
	int len = strlen(c);
	int i=0;
	for(;i<len;i++){
		insertOne(head,c[i]);
	}
	printf("作业１无序单字符输入，输出升序结果:\n");
	show(head);
	printf("作业２单向链表的逆置:\n");
	reverse(head);
	show(head);
	head = freeLink(head);
	return 0;
}

result:

请随机输入几个字符:asjdkajkd
作业１无序单字符输入，输出升序结果:
aaddjjkks
作业２单向链表的逆置:
skkjjddaa