数据结构之SWUSTOJ1039: 单链表中信息的分类

题目：

代码：

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
typedef struct SList
{
	char data;
	struct SList* next;
}SL;//单链表结构体的创建
void SListInit(SL** ps)
{
	(*ps) = (SL*)malloc(sizeof(SL));
	(*ps)->next = NULL;
}//链表的初始化，给一个不存放有效数据的哨兵位头结点
void SListCreate(SL** ps, char arr[], int n)
{
	SL* cur = *ps;
	int i = 0;
	while (n)
	{
		SL* newnode = (SL*)malloc(sizeof(SL));
		newnode->data = arr[i];
		cur->next = newnode;
		cur = newnode;
		n--;
		i++;
	}
	cur->next = NULL;
}//链表的赋值创建
int main()
{
	SL* p;
	SListInit(&p);
	char arr[100] = { 0 };//输入数据值
	scanf("%s", arr);
	getchar();
	int n = strlen(arr);//用一个n来存放一下有效数据的个数
	SListCreate(&p, arr, n);
	SL* Figure;//存放数字的链表
	SListInit(&Figure);
	SL* letter;//存放字母的链表
	SListInit(&letter);
	SL* others;//存放其余的链表
	SListInit(&others);
	char a1[100], a2[100], a3[100];//创建三个数组来分别存放三个类型的数据
	int i = 0, j = 0, q = 0;//用三个值来分别记录每个数组的下标
	SL* cur = p->next;
	while (cur != NULL)
	{
		if (cur->data >= '0' && cur->data <= '9')
		{
			a1[i] = cur->data;
			i++;
		}
		else if (cur->data >= 'a' && cur->data <= 'z')
		{
			a2[j] = cur->data;
			j++;
		}
		else
		{
			a3[q] = cur->data;
			q++;
		}
		cur = cur->next;
	}
	SListCreate(&Figure, a1, i);
	SListCreate(&letter, a2, j);
	SListCreate(&others, a3, q);//依次对每个链表进行赋值创建
	SL* cur1 = Figure->next;//用cur1来循环打印每个元素
	while (cur1 != NULL)
	{
		cout << cur1->data;
		cur1 = cur1->next;
	}
	cout << endl;//注意换行
	SL* cur2 = letter->next;//用cur2来循环打印每个元素
	while (cur2 != NULL)
	{
		cout << cur2->data;
		cur2 = cur2->next;
	}
	cout << endl;
	SL* cur3 = others->next;//用cur3来循环打印每个元素
	while (cur3 != NULL)
	{
		cout << cur3->data;
		cur3 = cur3->next;
	}
	cout << endl;
	return 0;
}