问题 A: 实验11_4_初识链表
时间限制: 1 Sec 内存限制: 128 MB
题目描述
已知一个正整数序列，个数未知，但至少有一个元素，你的任务是建立一个单链表，并使用该链表存储这个正整数序列，然后统计这个序列中元素的最大值与最小值，计算序列全部元素之和。正整数的输入用-1作为结束标志，注意-1不算这个正整数序列中的元素（不要统计-1）。
输入
一个正整数序列，正整数序列元素的个数未知，但以输入“-1”结束，输入“-1”前至少输入一个正整数。序列中的元素范围在1—999999999之间。
输出
三个正整数，即最大值、最小值、所有元素之和。
数据最多的测试用例节点数在1000这个数量级，所有整数可以用int型存储。
请注意输入输出格式。
样例输入
1 4 99 21 50 61 32 4 -1
样例输出
The maximum,minmum and the total are:99 1 272
#include <stdio.h>
#include <stdlib.h>
//#define LENSE
struct number{
int data;
struct number * nextPtr;
};
void createList(){
struct number * headPtr = NULL,* lastPtr = NULL,* currentPtr = NULL;
int num,min = 999999999,max = 0,sum = 0;
scanf("%d",&num);
while (num != -1){
currentPtr = malloc(sizeof (struct number));
sum += num;
max = num>max?num:max;
min = num<min?num:min;
if (currentPtr != NULL){
currentPtr->data = num;
if (headPtr == NULL){
headPtr = currentPtr;
lastPtr = currentPtr;
} else {
lastPtr->nextPtr = currentPtr;
lastPtr = currentPtr;
}
}
scanf("%d",&num);
}
lastPtr->nextPtr = NULL;
printf("The maximum,minmum and the total are:%d %d %d",max,min,sum);
}
int main() {
createList();
return 0;
}
问题 B: 实验11_10_链表排序
时间限制: 1 Sec 内存限制: 128 MB
题目描述
已知一个正整数组成的无序序列，个数未知，但至少有一个元素，你的任务是建立一个单链表，并使用该链表存储这个正整数序列，然后将这个链表进行排序，使得排序后的链表为递增序列。正整数的输入用-1作为结束标志，注意-1不算这个正整数序列中的元素（不要统计-1）。在排序的过程中，你可以自己选择排序算法（冒泡排序、选择排序等），但必须是通过修改结点的指针域来进行排序，而不是对结点的数据域进行修改。程序结束后要释放所有节点占据的空间。
输入
一个元素个数未知的正整数序列，以输入“-1”结束，输入“-1”前至少输入一个正整数。
输出
经过排序后的链表，每个元素后有一个空格，注意最后一个元素后只有换行符。
数据最多的测试用例节点数在1000这个数量级，所有整数可以用int型存储。
请注意输入输出格式。
样例输入
49 38 65 97 76 13 27 49 -1
样例输出
The new list is:13 27 38 49 49 65 76 97
#include <stdio.h>
#include <stdlib.h>
struct NUM{
int num;
struct NUM * nextPtr;
};
int storage(struct NUM * headPtr){
struct NUM * lastPtr,* newPtr;
if (headPtr != NULL){//分配成功
headPtr->nextPtr = NULL;
lastPtr = headPtr;
}
int input,numberOfNums = 0;
scanf("%d",&input);
while (input != -1){
newPtr = malloc(sizeof (struct NUM));
newPtr->num = input;
newPtr->nextPtr = NULL;
lastPtr->nextPtr = newPtr;
lastPtr = newPtr;
numberOfNums++;
scanf("%d",&input);
//printf("%d ",lastPtr->num);
}
return numberOfNums;
}
void sort(struct NUM * headPtr,int size){
int temp;
//printf("size=%d",size);
struct NUM * currentPtr, * previousPtr;
previousPtr = headPtr->nextPtr;//指向第一个真正有元素的单元格
currentPtr = previousPtr->nextPtr;//指向第二个真正有元素的单元格
for (int loc = size-1; loc >= 1 ; --loc) {
for (int i = 0; i <= loc-1; ++i) {
if (previousPtr->num > currentPtr->num){
temp = previousPtr->num;
previousPtr->num = currentPtr->num;
currentPtr->num = temp;
}
previousPtr = previousPtr->nextPtr;
currentPtr = currentPtr->nextPtr;
}
previousPtr = headPtr->nextPtr;
currentPtr = previousPtr->nextPtr;
}
}
void print(struct NUM * headPtr,int numberOfNums){
struct NUM * currentPtr = headPtr->nextPtr;
printf("The new list is:");
for (int i = 0; i < numberOfNums; ++i) {
printf("%d ",currentPtr->num);
currentPtr = currentPtr->nextPtr;
}
printf("\n");
}
int main() {
struct NUM * headPtr = malloc(sizeof (struct NUM));
int numberOfNums = storage(headPtr);
//printf("numberOfNums=%d\n",numberOfNums);
sort(headPtr,numberOfNums);
print(headPtr,numberOfNums);
return 0;
}
问题 C: 实验11_11_链表匹配
时间限制: 1 Sec 内存限制: 128 MB
题目描述
已知两个由正整数组成的无序序列A、B，每个序列的元素个数未知，但至少有一个元素。你的任务是判断序列B是否是序列A的连续子序列。假设B是“1 9 2 4 18”，A是“33 64 1 9 2 4 18 7”，B是A的连续子序列；假设B是“1 9 2 4 18”，A是“33 1 9 64 2 4 18 7”，B不是A的连续子序列。
要求：
建立两个单链表A、B用于存储两个正整数序列，然后按照题目的要求，判断链表B是否是链表A的连续子序列。正整数的输入用-1作为结束标志，注意-1不算这个正整数序列中的元素（不要统计-1）。在程序结束前要释放链表A、B中的所有节点。
输入
依次输入两个乱序的正整数序列A、B，序列中元素个数未知，但每个序列至少有一个元素，并以输入“-1”结束，每个序列占一行。
输出
如果序列B是序列A的连续子序列，则输出“ListB is the sub sequence of ListA.”，否则输出“ListB is not the sub sequence of ListA.”。
数据最多的测试用例节点数在100这个数量级，所有整数可以用int型存储。
请注意输入输出格式。
样例输入
Sample 1: 5 4 3 2 1 -1 3 2 1 -1 Sample 2: 1 2 3 4 5 6 7 8 9 -1 1 2 3 4 5 6 7 8 0 -1
样例输出
Sample 1: ListB is the sub sequence of ListA. Sample 2: ListB is not the sub sequence of ListA.
#include <stdio.h>
#include <stdlib.h>
struct NUM{
int num;
struct NUM * nextPtr;
};
int main() {
struct NUM *headPtrOne = (struct NUM *)malloc(sizeof(struct NUM));
headPtrOne->nextPtr = NULL;
headPtrOne->num = 0;
struct NUM *headPtrTwo = (struct NUM *)malloc(sizeof(struct NUM));
headPtrTwo->nextPtr = NULL;
headPtrTwo->num = 0;
//读入两个数列
struct NUM * newPtr,* lastPtrOne,* lastPtrTwo;
lastPtrOne = headPtrOne;
lastPtrTwo = headPtrTwo;
int data;
//读入第一个数列
scanf("%d",&data);
while (data != -1){
newPtr = (struct NUM *)malloc(sizeof (struct NUM));
newPtr->num = data;
newPtr->nextPtr = NULL;
lastPtrOne->nextPtr = newPtr;
lastPtrOne = newPtr;
scanf("%d",&data);
//printf("%d, ",lastPtrOne->num);
}
//读入第二个数列
scanf("%d",&data);
while (data != -1){
newPtr = (struct NUM *)malloc(sizeof (struct NUM));
newPtr->num = data;
newPtr->nextPtr = NULL;
lastPtrTwo->nextPtr = newPtr;
lastPtrTwo = newPtr;
scanf("%d",&data);
//printf("%d,, ",lastPtrTwo->num);
}
//查找与比较
int prim = 1;
struct NUM * storageLocation = headPtrOne->nextPtr,* searchingA = headPtrOne->nextPtr,* searchingB = headPtrTwo->nextPtr;
while (storageLocation != NULL&& prim == 1){
searchingA = storageLocation;
if (searchingA->num == searchingB->num){
while (searchingA != NULL && searchingB != NULL){
if (searchingA->num == searchingB->num){
searchingA = searchingA->nextPtr;
searchingB = searchingB->nextPtr;
} else {
break;
}
}
if (searchingB == NULL){
printf("ListB is the sub sequence of ListA.\n");
prim = 0;
} else {
searchingB = headPtrTwo->nextPtr;
}
}
storageLocation = storageLocation->nextPtr;
}
if (prim == 1){
printf("ListB is not the sub sequence of ListA.\n");
}
//释放内存
struct NUM * temp = headPtrOne->nextPtr;
while (temp != NULL){
free(headPtrOne);
headPtrOne = temp;
temp = temp->nextPtr;
}
temp = headPtrTwo->nextPtr;
while (temp != NULL){
free(headPtrTwo);
headPtrTwo = temp;
temp = temp->nextPtr;
}
return 0;
}//将上一段代码平行转移为函数写法
#include <stdio.h>
#include <stdlib.h>
struct NUM{
int num;
struct NUM * nextPtr;
};
//读入两个数列
void input(struct NUM** headPtrOne,struct NUM** headPtrTwo){
struct NUM * newPtr,* lastPtrOne,* lastPtrTwo;
lastPtrOne = *headPtrOne;
lastPtrTwo = *headPtrTwo;
int data;
//读入第一个数列
scanf("%d",&data);
while (data != -1){
newPtr = (struct NUM *)malloc(sizeof (struct NUM));
newPtr->num = data;
newPtr->nextPtr = NULL;
lastPtrOne->nextPtr = newPtr;
lastPtrOne = newPtr;
scanf("%d",&data);
//printf("%d, ",lastPtrOne->num);
}
//读入第二个数列
scanf("%d",&data);
while (data != -1){
newPtr = (struct NUM *)malloc(sizeof (struct NUM));
newPtr->num = data;
newPtr->nextPtr = NULL;
lastPtrTwo->nextPtr = newPtr;
lastPtrTwo = newPtr;
scanf("%d",&data);
//printf("%d,, ",lastPtrTwo->num);
}
}
void searchAndCompare(struct NUM** headPtrOne,struct NUM** headPtrTwo){
//查找与比较
int prim = 1;
struct NUM * storageLocation = (*headPtrOne)->nextPtr,* searchingA = (*headPtrOne)->nextPtr,* searchingB = (*headPtrTwo)->nextPtr;
while (storageLocation != NULL&& prim == 1){
searchingA = storageLocation;
if (searchingA->num == searchingB->num){
while (searchingA != NULL && searchingB != NULL){
if (searchingA->num == searchingB->num){
searchingA = searchingA->nextPtr;
searchingB = searchingB->nextPtr;
} else {
break;
}
}
if (searchingB == NULL){
printf("ListB is the sub sequence of ListA.\n");
prim = 0;
} else {
searchingB = (*headPtrTwo)->nextPtr;
}
}
storageLocation = storageLocation->nextPtr;
}
if (prim == 1){
printf("ListB is not the sub sequence of ListA.\n");
}
}
void clear(struct NUM** headPtrOne,struct NUM** headPtrTwo){
//释放内存
struct NUM * newPtr = *headPtrOne,*tempPtr = NULL;
while (newPtr->nextPtr != NULL){
tempPtr = newPtr;
newPtr = newPtr->nextPtr;
free(tempPtr);
}
free(newPtr);
newPtr = *headPtrTwo,tempPtr = NULL;
while (newPtr->nextPtr != NULL){
tempPtr = newPtr;
newPtr = newPtr->nextPtr;
free(tempPtr);
}
free(newPtr);
}
int main() {
struct NUM *headPtrOne = (struct NUM *)malloc(sizeof(struct NUM));
headPtrOne->nextPtr = NULL;
headPtrOne->num = 0;
struct NUM *headPtrTwo = (struct NUM *)malloc(sizeof(struct NUM));
headPtrTwo->nextPtr = NULL;
headPtrTwo->num = 0;
input(&headPtrOne,&headPtrTwo);
searchAndCompare(&headPtrOne,&headPtrTwo);
clear(&headPtrOne,&headPtrTwo);
return 0;
}
问题 D: 实验11_13_链表交换
时间限制: 1 Sec 内存限制: 128 MB
题目描述
已知一个正整数序列，序列元素个数未知，但至少有两个元素，你的任务是建立一个单链表用于存储这个正整数序列。然后实现交换此链表中任意指定的两段，第一段为[s1,t1]，第二段[s2,t2]。s1、t1、s2、t2代表链表的第几个节点，且满足s1<=t1，s2<=t2，t1<s2，s2一定小于等于链表节点的总个数。正整数的输入用-1作为结束标志，注意-1不算这个正整数序列中的元素（不要统计-1）。最后将链表的全部节点释放。
输入
输入一个正整数序列，以输入“-1”结束，序列中元素个数未知，但输入“-1”前至少输入两个正整数。然后是四个整数，即为s1、t1、s2、t2。
输出
经过处理后的新链表，每个元素后有一个空格，注意最后一个元素后只有换行符。
数据最多的测试用例节点数在100这个数量级，所有整数可以用int型存储。
请注意输入输出格式。
样例输入
1 2 3 4 5 6 7 8 9 10 -1 1 1 4 7
样例输出
The new list is:4 5 6 7 2 3 1 8 9 10
#include <stdio.h>
#include <stdlib.h>
struct NUM{
int data;
struct NUM * nextPtr;
};
int input(struct NUM ** headPtr){
int num,numberOfNums = 0;
scanf("%d",&num);
struct NUM * currentPtr = *headPtr;
while (num != -1){
struct NUM * newPtr = malloc(sizeof (struct NUM));
newPtr->data = num;
newPtr->nextPtr = NULL;
currentPtr->nextPtr = newPtr;
currentPtr = newPtr;
scanf("%d",&num);
numberOfNums++;
//printf("%d,,",currentPtr->data);
}
struct NUM* lastPtr = malloc(sizeof (struct NUM));
lastPtr->data = -1;
lastPtr->nextPtr = NULL;
currentPtr->nextPtr = lastPtr;
return numberOfNums;
}
void storageAndSwitch(struct NUM ** headPtr){
int nodeOne,nodeTwo,nodeThree,nodeFour;
scanf("%d %d %d %d",&nodeOne,&nodeTwo,&nodeThree,&nodeFour);
//printf("%d %d %d %d",nodeOne,nodeTwo,nodeThree,nodeFour);
struct NUM * nodePtrOne = NULL,* nodePtrTwo = NULL,* nodePtrThree = NULL,* nodePtrFour = NULL,* previousPtr = NULL,* lastPtr = NULL,* currentPtr = * headPtr,*p=NULL;
for (int i = 0; i < nodeFour+1; ++i) {
if (i == nodeOne-1){
previousPtr = currentPtr;
nodePtrOne = (currentPtr->nextPtr);
}
if (i == nodeTwo){
nodePtrTwo = currentPtr;
}
if (i == nodeThree-1){
nodePtrThree = currentPtr->nextPtr;
p=currentPtr;
}
if (i == nodeFour){
nodePtrFour = currentPtr;
lastPtr = (currentPtr->nextPtr);
}
currentPtr = currentPtr->nextPtr;
}
//该题目的两种情况，不要漏掉！
if (nodePtrTwo->nextPtr == nodePtrThree){
previousPtr->nextPtr = nodePtrThree;
nodePtrFour->nextPtr = nodePtrOne;
nodePtrTwo->nextPtr = lastPtr;
} else {
(previousPtr->nextPtr) = nodePtrThree;
(nodePtrFour->nextPtr) = nodePtrTwo->nextPtr;
p->nextPtr = nodePtrOne;
(nodePtrTwo->nextPtr) = lastPtr;
}
}
void print(struct NUM ** headPtr,int numberOfNums){
printf("The new list is:");
struct NUM * currentPtr = (*headPtr)->nextPtr;
for (int i = 1; i < numberOfNums; ++i) {
printf("%d ",currentPtr->data);
currentPtr = currentPtr->nextPtr;
}
printf("%d\n",currentPtr->data);
}
void destroyList(struct NUM ** headPtr){
struct NUM * newPtr = *headPtr,*tempPtr = NULL;
while (newPtr->nextPtr != NULL){
tempPtr = newPtr;
newPtr = newPtr->nextPtr;
free(tempPtr);
}
free(newPtr);//PPT缺失此句
}
int main() {
struct NUM * headPtr = malloc(sizeof (struct NUM));
headPtr->data = 0;
headPtr->nextPtr = NULL;
int numberOfNums = input(&headPtr);
storageAndSwitch(&headPtr);
print(&headPtr,numberOfNums);
destroyList(&headPtr);
return 0;
}问题 E: 实验11_9_链表归并
时间限制: 1 Sec 内存限制: 128 MB
题目描述
已知有两个递增的正整数序列A和B，序列中元素个数未知，同一序列中不会有重复元素出现，有可能某个序列为空。现要求将序列B归并到序列A中，且归并后序列A的数据仍然按递增顺序排列。如果序列B中某些数据在序列A中也存在，则这些数据所在节点仍然留在序列B中，而不被归并到序列A中；否则这些数据所在节点将从序列B中删除，添加到序列A中。
要求：
建立两个单链表A、B用于存储两个正整数序列，然后按照题目的要求，将链表B中的元素归并到链表A中。在归并的过程中，不要释放B中的节点空间、然后建立新节点，而要改变指针的指向，使元素从B中删除并添加到A中。正整数序列按照递增顺序输入，用-1作为结束标志，注意-1不算这个正整数序列中的元素（不要统计-1）。在程序结束前要释放链表A、B中的所有节点。
输入
依次输入两个递增的正整数序列A和B，序列元素的个数未知，但以输入“-1”结束，每个正整数序列占一行。
输出
处理后的链表A中的元素，占一行；然后是处理后的链表B中的元素，占一行。每行的每个元素后有一个空格，注意最后一个元素后只有换行符，如果某个链表为空则，则输出“There is no item in X list.”
数据最多的测试用例节点数在100这个数量级，所有整数可以用int型存储。
请注意输入输出格式。
样例输入
Sample 1: 1 3 4 5 6 7 -1 2 3 6 8 9 10 11-1 Sample 2: -1 -1
样例输出
Sample 1: The new list A:1 2 3 4 5 6 7 8 9 10 11 The new list B:3 6 Sample 2: There is no item in A list. There is no item in B list.
#include <stdio.h>
#include <stdlib.h>
struct NUM{
int data;
struct NUM * nextPtr;
};
int main() {
//第一部分：读入两个链表
int num,numberOfNumsInB = 0,numberOfNumsInA = 0;
struct NUM *headPtrOne, *headPtrTwo, *currentPtrOne, *currentPtrTwo;
headPtrOne = malloc(sizeof(struct NUM));
headPtrOne->nextPtr = NULL;
headPtrOne->data = 0;
currentPtrOne = headPtrOne;
headPtrTwo = malloc(sizeof(struct NUM));
headPtrTwo->nextPtr = NULL;
headPtrTwo->data = 0;
currentPtrTwo = headPtrTwo;
scanf("%d", &num);
while (num != -1) {
struct NUM * newPtr = (struct NUM *)malloc(sizeof(struct NUM));
newPtr->data = num;
newPtr->nextPtr = NULL;
currentPtrOne->nextPtr = newPtr;
currentPtrOne = newPtr;
numberOfNumsInA++;
scanf("%d", &num);
//printf("%d?", currentPtrOne->data);
}
struct NUM* lastPtrOne = malloc(sizeof(struct NUM));
lastPtrOne->nextPtr = NULL;
lastPtrOne->data = -1;
currentPtrOne->nextPtr = lastPtrOne;
scanf("%d",&num);
while (num != -1){
struct NUM * newPtr = malloc(sizeof (struct NUM));
newPtr->data = num;
newPtr->nextPtr = NULL;
currentPtrTwo->nextPtr = newPtr;
currentPtrTwo = newPtr;
numberOfNumsInB++;
scanf("%d",&num);
//printf("%d!",currentPtrTwo->data);
}
struct NUM* lastPtrTwo = malloc(sizeof(struct NUM));
lastPtrTwo->nextPtr = NULL;
lastPtrTwo->data = -1;
currentPtrTwo->nextPtr = lastPtrTwo;
//printf("numberOfNumsInA=%d,,numberOfNumsInB=%d",numberOfNumsInA,numberOfNumsInB);
//第二部分：插入
struct NUM * previousPtrB = headPtrTwo,* previousPtrA = headPtrOne,* currentPtrA,* currentPtrB;
currentPtrA = previousPtrA->nextPtr;
currentPtrB = previousPtrB->nextPtr;
int searchingB = currentPtrB->data,storageNUMB = numberOfNumsInB;
for (int i = 0; i < storageNUMB; ++i) {
while ((currentPtrA->data) < searchingB && currentPtrA->data != -1){
currentPtrA = currentPtrA->nextPtr;
previousPtrA = previousPtrA->nextPtr;
}
if (currentPtrA->data == searchingB && currentPtrA->data != -1){
previousPtrB = previousPtrB->nextPtr;
currentPtrB = currentPtrB->nextPtr;
currentPtrA = currentPtrA->nextPtr;
previousPtrA = previousPtrA->nextPtr;
searchingB = currentPtrB->data;
} else {
previousPtrB->nextPtr = currentPtrB->nextPtr;
previousPtrA->nextPtr = currentPtrB;
currentPtrB->nextPtr = currentPtrA;
previousPtrA = currentPtrB;
currentPtrB = previousPtrB->nextPtr;
searchingB = currentPtrB->data;
numberOfNumsInB--;
numberOfNumsInA++;
}
}
//第三部分：打印两个新链表
struct NUM * printA = headPtrOne->nextPtr,* printB =headPtrTwo->nextPtr;
if (printA->data == -1){
printf("There is no item in A list.\n");
} else {
printf("The new list A:");
for (int i = 1; i < numberOfNumsInA; ++i) {
printf("%d ",printA->data);
printA = printA->nextPtr;
}
printf("%d\n",printA->data);
}
if (printB->data == -1){
printf("There is no item in B list.\n");
} else {
printf("The new list B:");
for (int i = 1; i < numberOfNumsInB; ++i) {
printf("%d ",printB->data);
printB = printB->nextPtr;
}
printf("%d\n",printB->data);
}
return 0;
}
问题 F: 实验11_15_拆分链表
时间限制: 1 Sec 内存限制: 128 MB
题目描述
已知有一个乱序的字符序列L，序列中的字符可能是英文字母、数字字符或其它字符，字符的个数未知，每个字符之间用空格分开。字符序列用“-1”作为输入结束标志，这里你要把-1当做一个字符串对待，并且不算作字符序列中的元素。如下即为一个合法的字符序列：“a c 3 b a d 6 , & j m 8 7 2 V -1”。你的任务是将这个字符序列拆分为三个独立的序列A、B和C，其中序列A存放序列L中的字母，序列B存放序列L中的数字，序列C存放序列L中的其他字符，然后，将序列A、B和C分别按照ASCII码的大小关系进行升序排序。最终序列L将变为空序列。
要求：
建立四个单链表，分别存储序列L、A、B、C中的元素。字符序列的输入用“-1”作为结束标志。建立链表L时，建议使用scanf(“%s”,s);来读取字符序列中的字符，即把单独的字符看做一个字符串读取。当L建立后，你要按照问题描述中所述，将L拆分为A、B、C三个链表，然后对每个链表都进行排序，这部分的操作都应该是对指针进行修改，而不是删除节点与建立新节点。在程序结束前要释放链表A、B、C中的所有节点。
输入
一个乱序的字符序列，序列元素的个数未知，以输入“-1”结束，输入“-1”前可能没有其它元素，每个字符序列占一行。
输出
链表A中的元素，占一行；然后是链表B中的元素，占一行。最后是链表C中的元素，占一行。每行的每个元素后有一个空格，注意最后一个元素后只有换行符，如果某个链表为空则，则输出“There is no item in X list.”
数据最多的测试用例节点数在100这个数量级。
请注意输入输出格式。
样例输入
Sample 1: a c 3 b a d 6 , & j m 8 7 2 V -1 Sample 2: z m v 1 a K 2 m p 9 a 0 a d -1
样例输出
Sample 1: The list A is: V a a b c d j m The list B is: 2 3 6 7 8 The list C is: & , Sample 2: The list A is: K a a a d m m p v z The list B is: 0 1 2 9 There is no item in C list.
#include <stdio.h>
#include <stdlib.h>
struct NUM{
char value;
struct NUM * nextPtr;
};
void input(struct NUM ** headPtr){
char all[1000],* allPtr=all;
gets(all);
struct NUM* currentPtr = (*headPtr);
while(!((*allPtr=='-')&&(*(allPtr+1)=='1'))){
if (*allPtr == ' '){
allPtr++;
} else {
struct NUM *newPtr = malloc(sizeof (struct NUM));
newPtr->value = *allPtr;
newPtr->nextPtr = NULL;
currentPtr->nextPtr = newPtr;
currentPtr = newPtr;
allPtr++;
//printf("%c\\",currentPtr->value);
}
}
struct NUM * lastPtr = malloc(sizeof (struct NUM));
lastPtr->value = -1;
lastPtr->nextPtr = NULL;
currentPtr->nextPtr = lastPtr;
}
int* separate(struct NUM** headPtrALL, struct NUM** headPtrNUM, struct NUM** headPtrCHAR, struct NUM** headPtrOTR){
struct NUM* currentPtrALL = (*headPtrALL)->nextPtr,* currentPtrNUM = *headPtrNUM,* currentPtrCHAR = *headPtrCHAR,* currentPtrOTR = *headPtrOTR;
static int storage[10];
int numNUM = 0,numCHAR=0,numOTR=0;
while (currentPtrALL->value != -1){
if (currentPtrALL->value >= '0'&¤tPtrALL->value <= '9'){
struct NUM* newPtr = malloc(sizeof (struct NUM));
newPtr->value = currentPtrALL->value;
newPtr->nextPtr = NULL;
currentPtrNUM->nextPtr = newPtr;
currentPtrNUM = newPtr;
numNUM++;
//printf("%c$",currentPtrNUM->value);
} else if (currentPtrALL->value >= 'a'&¤tPtrALL->value <= 'z'||currentPtrALL->value >= 'A'&¤tPtrALL->value <= 'Z'){
struct NUM* newPtr = malloc(sizeof (struct NUM));
newPtr->value = currentPtrALL->value;
newPtr->nextPtr = NULL;
currentPtrCHAR->nextPtr = newPtr;
currentPtrCHAR = newPtr;
numCHAR++;
//printf("%c@",currentPtrCHAR->value);
} else {
struct NUM* newPtr = malloc(sizeof (struct NUM));
newPtr->value = currentPtrALL->value;
newPtr->nextPtr = NULL;
currentPtrOTR->nextPtr = newPtr;
currentPtrOTR = newPtr;
numOTR++;
//printf("%c~",currentPtrOTR->value);
//printf("\n");
}
currentPtrALL = currentPtrALL->nextPtr;
}
storage[0]=numNUM;
storage[1]=numCHAR;
storage[2]=numOTR;
struct NUM * lastPtrNUM = malloc(sizeof (struct NUM)),* lastPtrCHAR = malloc(sizeof (struct NUM)),* lastPtrOTR = malloc(sizeof (struct NUM));
lastPtrNUM->value = -1;
lastPtrCHAR->value = -1;
lastPtrOTR->value = -1;
lastPtrNUM->nextPtr = NULL;
lastPtrCHAR->nextPtr = NULL;
lastPtrOTR->nextPtr = NULL;
currentPtrNUM->nextPtr = lastPtrNUM;
currentPtrCHAR->nextPtr = lastPtrCHAR;
currentPtrOTR->nextPtr = lastPtrOTR;
return storage;
//C 语言不允许返回一个完整的数组作为函数的参数。
//C 不支持在函数外返回局部变量的地址，除非定义局部变量为 static 变量。
//该函数期望返回一个数组，故此处必须创建声明为static的数组
}
void bubbleSort(struct NUM ** headPtr,int size){
struct NUM* ppre,*current = NULL,*pre,*temp;
ppre = *headPtr;
pre = ppre->nextPtr;
//printf("size==%d",size);
if (pre->value != -1) {
current = pre->nextPtr;
}
if (current != NULL&¤t->value != -1){
for (int loc = size-1;loc >= 1;loc--) {
ppre = *headPtr;
pre = ppre->nextPtr;
current = pre->nextPtr;
for (int i = 0;i <= loc-1;i++) {
if (pre->value > current->value){
ppre->nextPtr = current;
pre->nextPtr = current->nextPtr;
current->nextPtr = pre;
temp = current;
current = pre;
pre = temp;
}
current = current->nextPtr;
pre = pre->nextPtr;
ppre = ppre->nextPtr;
}
}
}
}
void print(struct NUM** headPtr,int size,char mark){
//printf("size=%d",size);
struct NUM* currentPtr = (*headPtr)->nextPtr;
if (size == 0){
printf("There is no item in %c list.\n",mark);
} else {
printf("The list %c is:",mark);
while (currentPtr->value != -1){
printf(" %c",currentPtr->value);
currentPtr = currentPtr->nextPtr;
}
printf("\n");
}
}
int main() {
int *storage;
struct NUM * headPtrALL,* headPtrNUM,* headPtrCHAR,* headPtrOTR;
headPtrALL = malloc(sizeof (struct NUM));
headPtrNUM = malloc(sizeof (struct NUM));
headPtrCHAR = malloc(sizeof (struct NUM));
headPtrOTR = malloc(sizeof (struct NUM));
headPtrALL->value = 0;
headPtrNUM->value = 0;
headPtrCHAR->value = 0;
headPtrOTR->value = 0;
headPtrALL->nextPtr = NULL;
headPtrNUM->nextPtr = NULL;
headPtrCHAR->nextPtr = NULL;
headPtrOTR->nextPtr = NULL;
input(&headPtrALL);
storage = separate(&headPtrALL, &headPtrNUM, &headPtrCHAR, &headPtrOTR);
//printf("\n%d,%d,%d\n",*storage,storage[1],storage[2]);
bubbleSort(&headPtrNUM,storage[0]);
bubbleSort(&headPtrCHAR,storage[1]);
bubbleSort(&headPtrOTR,storage[2]);
print(&headPtrCHAR,storage[1],'A');
print(&headPtrNUM,storage[0],'B');
print(&headPtrOTR,storage[2],'C');
return 0;
}
1406
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
