零基础学C/C++195——记录信息

题目描述

利用动态链表输入、存储若干学生的信息，包括学号、姓名、性别、年龄、成绩，再按输入顺序倒叙输出。其中，学号长度不超过20个字符，姓名长度不超过40个字符，性别为一个字母f或m，年龄和成绩为一个整数。

输入

若干行，每一行都是一个学生的信息。例如 20170118 zhangsan m 15 100,其中的字符都是小写字母，输入以"end"结束

输出

将输入的内容倒叙输出，每行一条记录，按照学号、姓名、性别、年龄、成绩的格式输出

样例输入
20170210 zhangsan f 16 100
20170140 wangyuan m 15 98
20170118 lisi f 14 65
20170928 zhaojing m 15 99
end

样例输出
20170928 zhaojing m 15 99
20170118 lisi f 14 65
20170140 wangyuan m 15 98
20170210 zhangsan f 16 100

纪念第一次链表AC
都是链表的基础，不过多注释( ´Д`)

#include<iostream>
#include<stdlib.h>
#include<string.h>
#include<bits/stdc++.h>
using namespace std;
typedef struct stu {
	char num[100];
	char name[100];
	char sex;
	int old;
	int sco;
	struct stu *next;
}Node;
Node* Creat(char* m_num, char* m_name, char m_sex, int m_old, int m_sco) {
	Node* p = (Node*)malloc(sizeof(Node));
	strcpy(p->num, m_num);
	strcpy(p->name, m_name);
	p->sex = m_sex;
	p->old = m_old;
	p->sco = m_sco;
	p->next = NULL;
	return p;
}
Node* Insert(Node* head, Node* add)  //处理逆序的核心
{
	if (head == NULL) return add; 
	add->next = head;    //新增的节点指向原来的头结点
	head = add;          //头结点变成了新增的节点
	return head;
}
void Print(Node* head)
{
	while (head!=NULL)
	{
		cout << head->num << " ";
		cout << head->name << " ";
		cout << head->sex << " ";
		cout << head->old << " ";
		cout << head->sco << endl;
		head = head->next;
	}
}
void Destory(Node* head)
{
	if (head != NULL)
	{
		 Destory(head->next );
		 free(head);
	}
}

int main()
{
	char m_num[50], m_name[100];
	char m_sex='0'; //为啥要初值为'0'？编译器报错，说一定要有个初值orz
	int m_old=0, m_sco=0;
	Node* head = NULL;
	while (cin >> m_num)
	{
		if (strcmp(m_num ,"end")!=0)
		{
			cin >> m_name>>m_sex ;
			cin >> m_old >> m_sco;
			Node* add = Creat(m_num, m_name, m_sex, m_old, m_sco);
			head = Insert(head, add);
			
		}
		else
		{
			goto ca;
		}
	}
ca:;
	Print(head);
	Destory(head);
	return 0;
}