题目

aaarticlea/png;base64,iVBORw0KGgoAAAANSUhEUgAAAiEAAAAwCAYAAADHAqqQAAAAAXNSR0IArs4c6QAAAARnQU1BAACxjwv8YQUAAAAJcEhZcwAADsMAAA7DAcdvqGQAAAx0SURBVHhe7Z2Ljty4DkQ398eDfPneLSAFFAokRdnqdnfCAxCW+ChS7ozXmExmf/z7H/8MwzAMwzC8mf/9vg7DMAzDMLyVeQkZhmEYhuER5iVkGIZhGIZHmJeQYRiGYRgeYV5ChmEYhmF4hI97Cfnx48fv1Zqd3FN0empOlP/EGd+tk+W98uxXznilZoVqRvpZT/hXdpJKb6fX6bkiTs2acfIMV7WyupOzgUqv2+v0TF12+16dM6u7c+4rtahZmaO+VXzFTq6yU/fV3wnBvy6+epPexTfMOMTgc6PtoJ+5f/5YV/8qHrHMhj342bkNMbg3+HPWuUfdvOE+/gzwfQVyPv1zevvvCfEbsrpJbx6vBHNy3mounoc5WheheV2q/hFd7dW5eI5OHtcrMq2qNqq50quaNZvrKtor4m58F9fTfbcX8ipOzXtl1si/k3sVaK3QXuytdYxr7MR8Ppv3IZ1+p2bqwn47fZG7Ijq31jF+pb/iddpD8ZydPaAu/cyh39G8Lj5DF58VlC8hHN5h06K0RaSvPo+zb4e7sznRLFGPzE9WcWc3P+IVGpmm+qOcnVlO5/psyp05iWt20B6d+t2ZIqI+0NUzd85f5XTqd+DM0XxZr8if1WUau6x6RjBe1a40dnCtTLvT8+RcFd2ZlShnVcd4VbvSUJAbsepBsnrF86vZVnGnkx/ldH0gfAlBMqmEMtEOrNVeGVd7nCI75+75Nb/SXHGl5x3dalb3e58onvVxurl38rLanTnJbs2VHqfQ3lzjmqFzMo81fobIdxWdza8Z7J3laDxaXyXTWGkz7nnuX+l0qHo4nZ4nZlqR9ah6X6kBjHue+1c6juZXGu7b3VdoblYH/wqvi7S6PrD1nZAd4RXpQOK/qn0Sn6GzJ/BzzzVzvS6jm7di1Tvr4/7Vnqgf6wyvrXJJ1L/TQ2cinXrifYH7XL9iN/8k2pvryNfhal2HaDaw0zOL72iscK0K7VPlRrOdmvOuDjipleHaqz1QH9YVrpWhetF6RVQX1bvvyp7Azz3XzPW6jE5elNP1gUdeQiLdjFdqZ6Cedd7f9YHnRjOoplPFKnyOimwmEu2B9/A84LlRTpdVbRbv+KOcXT2COMhqK6IZdqlm66Dni86i8Q6Rxgk4h8+7M2sWrzTvsDvfO8EsCuaKfKSanbFVzi46k+tGvbJc4PlR/TvQvlxHs0TzruhosF9EFatgD+8Huj7w2EsI2dW7G79LR99zopodnU5uBmp3qXqtZrkzK7iq3/FHOfCByB/p3aGr+YreiutH/XZmBa+cF1TzZPNXIF/rKv1dXKvSjmbQq5Pp7BL11bVfHfdneafZ7bMzp8a41quT6Tje07WVyKes4iDrp+zorHK7+pnOI/9EF4PoMBiOFu0V1EV+AH90yHfC2bIZu1Rn2dHWe811ZBq/C+aj+d7tKbQ/z+xz+f4q1Ojc227eHaAfnYlzMqZrx2Pcu70K7+H9cEZatP8GdOZqbj/7FU5o/Ml0P4sVuMeden4ebp0Y6+9QzRlp+0yZL+LRv465qpflXJlllyvzcY9rhOsxL9Pw/BVeE2l0dU/0J9kcKzKtDOZn/ao4yPxONUOG6nbq78znsN+Optas+kbxVU1GVbc7B/fqz3K6IH8XnUGvjCnZPOrPciK0T6ThVyXygcx/kk4P5OyiZ9UrY0pnBse11adk2l6f5QGPaU2E6zAv04jyr/rA1ndCOARxUew1nkEdXtVA5FN8DoC9zvKJYD6a7pXsHPBVZ0TM70kGtT4RzLayjCgXxnuD9Smi++19aasYieJqGYhd+TwrzYzVLCuuznqV6nOvzrE7J/Izy+JEZ1Q/OH2voEdNn+F0r6fg/Y0sixPcA+7VD6r7s7p/0FLtHaI66u2AGprulWxG+KpYhywvfAlBMx5Q14DDwLrNK6Chlvm+Db1nHbJ7qjqI7eoS6tPcx/0pVLeL5mdrsKurf452a7+J3bMh/86fqTt8y+fwjjn9a17h55PlMF7lKMiJ8jK/05nlm6nuAc/XuU8O6/z+YK/mwJf1i/RI5s9gf++lOlW/O4QvIWjmpkQ+kPkdHvbOgbRPdPOehvN0z4ocP0N0Lmq5nucp1K6MeXfhbKoL6FerQC1zdA18fxLOphbh53ua3VlwrhPz+71Sy3jXfcMMd3q9c87qvmGOyE8QPz1rpIcZVn1Ws346/AxoTna+6r4gn3Gvx16NsL/6IhBnrsI6anjcQY73ivpTa6W3Q/kzIa/AD9Y5DA++yyuO5vNXdM8a6e32AVfOu1u7MxfJatQf5VTxLL8D6jQ360Ey/4qoxxWoc0dDic6js0ZcuS+r+A6q1Zk16s069avWqVmdaJaKbPaT86ke17gCXQPud/rv5ne5q3viHO7DHkS6d+d1dvSyOZ1XzL0153+J1zsNwzAMwzBc5Kv/L7rDMAzDMHwv8xIyDMMwDMMjzEvIMAzDMAyPMC8hwzAMwzA8wryEDMMwDMPwCPMSMgzDMAzDI8xLyDAMwzAMjzAvIcMwDMMwPMKjLyHRb3DLfqsbyeKrOmUnl6Amqsv84EofZ0cjm2/F1TmzukrvSs0JXL/T7+pMn3JG4L6dGXZrs/idnie4OvcwDK9nvhNSgIcTDb9Ylr9cNvOfhvq4/kno/VPUrzH3V/anEZ2RdpVTOk/jZ/D9MAyfz2O/th0Piqh19ABhntZ0HjTZ0aparalmzLSVuzN2ZiHVrI7n7c7JXlrHuMaiPlFM91FdRDePVD0zkLMi0tQ6xjW26qtk+ZE/6pGtQaSh7OR7nxWVTobXsGd2Jb53VvFhGF7HI98JwRc9rzTu8TBQI4zp2vMiX4bn0k4RzegWgTrW4kq4Vx+hj3Hdaz+Yk+VEvohVnLAPwNVnJBq7S1cnyuNcaiDyRazip4hmR1/38zz0c+9EehGap1pcq4HIl+G5tF2is8DnVvmHYXgtj/11jD9c8EW/etA88XBgz53eyNt9aFJf7wmu2pMx5iqMwQC1Kjo5O1BPr8T7VH1PznSFd96XHa7WAZ5H5zgJNO/M9y5wbrfK/wp+/fr1ezUMw8f8TMjqi14fDLzywceHn+8Vj+le/Q77sifJ6nFFrsfUItgjyvV9NI+zikOLOarPHr4nGueV5j2xZx7RfMYi3yuI9LHXuXXPfJr7FI3zSuvcl9N4T6LzdGbgGRTVAFhzr9pa63vFY7pX/zAMfx4f94Op1QMHsejhF1lElEfbRet8TehXWxHV0K6Q3U/X8z6+J+p3I9kaaD5jkY/wP0Juq1iE6yPX+0V7rfM9Ub8bydbvIjrvCj9DpuF+1kUWEeXRIvg5r66fwHznYxhyHnsJwUOCpuChEz1A4MseSH8Dq/PzXvq9y+7nVVSLa726kSgGW8Uwf2SrWIed3BWcF3CtV7d3oH249hl03SG6Z6g/eS87sN/qqvCsbqvYHeYFZBhqHvnXMfji1rbVnmt/IEQ+RfWA93CieKTPvszNdDv+KAe+FVGN+qp91rOqVyKtLL/ScXZyQSdfczx/tx5UNVGvLL/ScSJdXe/EnSiW6YFMC34FOe5Tqp4RVV/26lwjqlgE8kGnJnsB+fnz5+/VMAwf+RKiXIlFfvhWRDUr/Sono6rN9EinptJgDNddWOdXxhTGlZ2eXutE+o7meH5WvzMjgQ719MqYkvXN0Pxo3fX5Gvge7OZnZLlZzxWVVvfqZP4Mze/W8kVkXjyGIebjfibkVeCBsbLTRD1geIDtPgBP4zOpZXGis6sfIJahWm4efwqdwS2Lk6v3BbEsTh1qMy/rAyIf0PpPAnOt7ApVHe+nc/r+zMvHMNR83XdC+JCAL6ur9LM1WO1JpUEyv9PtSaL4jsZKH+zW7/QHHY0VnXzNwZrA5/W7ek4U6/aAH3S1Kx33Z7lglY81gc/zoz2Ickmlka1BpEdfdiWrvVPFEQNV/TAMfT7uB1MzmIsvfn+guFWgljm6Br6PQFz7vwL0yCyjk3MK7RX1W93Hzn2+C/U5I3rSXgV70Zzs3NVMyPd4pnMXauLKvrQKzyf0q1Wgljm6Br7H2n0dmI9rZoxHoCdsGIYzfOx3QvgQqMaL6oD6M+0szv2qjkQ+gliHqH9GZ4YsB1TaZDWD05kpg3OBV+RXqBZY6XXPRKJ893GGSLfqpzFqgFU/UOWv0FrQmU9RfzZbFue+qsMV6Bp4/oqoxzAM53ns/x0zDMMwDMPfzV/zg6nDMAzDMHwW8xIyDMMwDMMjzEvIMAzDMAyPMC8hwzAMwzA8wD///B8SntEVPSy4AwAAAABJRU5ErkJggg==" alt="" />

解决代码及点评


/************************************************************************/

/*

10.	建立一个链表，每个结点包括：学号、姓名、性别、年龄。输入一个年龄，

如果链表中的结点所包含的年龄等于此年龄，将此结点删除，输出最后的链表。

  */

/************************************************************************/

#include <stdio.h>

#include <stdlib.h>

#include <math.h>

#include <string.h>

typedef struct	student STU;

struct student   // 保存学生信息的节点结构体

{

	int num;

	char name[10];

	int  age;

	int  sex;

	struct student * next;

};

STU * Init10()   // 初始化链表

{

	STU * p=(STU *)malloc(sizeof(STU));  // 初始化链表时，创建了一个头节点，该节点信息无意义

	if (p==NULL)  // 如果内存申请失败，则

	{

		return NULL;

	}

	else

		p->next=NULL;

	return p;  // 返回创建的头结点

}

void  Insert10(STU * head,int num,int aeg,int sex,char * name) // 将新学生信息插入链表

{	STU * last=head;

	if (last==NULL)

	{

		return;

	}

	while(last->next!=NULL)   // 找到最后一个节点

		last=last->next;

	STU *p=(STU *)malloc(sizeof(STU));  // 申请新节点空间

	if (p==NULL)

	{

		return;

	}

	else

	{

		p->num=num;   // 初始化新节点

		strcpy_s(p->name,name);

		p->age=aeg;

		p->sex=sex;

		last->next=p;    // 把新节点保存在链表最后

		p->next=NULL;

	}

}

void	DeleteNode10(STU* pre,STU *cur)

{

	pre->next=cur->next;   // 删除cur节点，pre是cur的前置节点

	free(cur);

}

void	printfNodes10(STU *head)  // 该函数遍历所有node，进行打印输出

{

	STU *p=head->next;

	while(p!=NULL)

	{

		printf("%5d",p->age);

		p=p->next;

	}

	printf("\n");

}

void main()

{	int num;

	scanf_s("%d",&num);   // 输入

	STU * A=Init10();  // 初始化链表，并插入一堆数据

	Insert10(A,1,12,1,"abc");

	Insert10(A,2,13,0,"abc");

	Insert10(A,3,14,1,"abc");

	Insert10(A,3,14,0,"abc");

    Insert10(A,4,15,1,"abc");

	printfNodes10(A);

	STU * index=A->next;

	STU * flower=A;

	while(index!=NULL)  // 遍历所有节点

	{

		if (index->age==num)  // 如果节点的年纪是指定需要删除的年纪

		{

			DeleteNode10(flower,index);  // 删除该节点

			index=flower->next;        // 继续遍历

		}

		else

		{

			index=index->next;   // 只是继续遍历

			flower=flower->next;

		}

	}

	printfNodes10(A);  // 输出新的链表

	system("pause");

}

代码编译以及运行

由于资源上传太多，资源频道经常被锁定无法上传资源，同学们可以打开VS2013自己创建工程，步骤如下：

1）新建工程