/////////////////////////////////////////////////////////////////////////////////////
//////////////////////// List.cpp : The body of the class List //////////////////////
/////////////////////////////////////////////////////////////////////////////////////

#include "list.h"

List::List()
{
	head = NULL;
}

bool List::check(char *a, char *b)		//對比兩個字符串是否相等
{
	int i;
	int j=strlen(b);
	for(i=0; i<j; i++)
	{
		if(*a==*b)
		{
			a++;
			b++;
		}
		else
			return 0;
	}
	return 1;
}


nodetype* List::creatlist (int n)       //創(chuàng)建鏈表
{
	nodetype *h=NULL, *s, *t;
	int i=1;

	for(int j=0; j<n; j++)
	{
		if(i==1)            //創(chuàng)建第一個節(jié)點(diǎn)
		{
			h=(nodetype*)malloc(sizeof(nodetype));
			h->next=NULL;
			t=h;
		}
		else                 //創(chuàng)建其余節(jié)點(diǎn)
		{
			s=(nodetype*)malloc(sizeof(nodetype));
			s->next=NULL;
			t->next=s;
			t=s;            //t 始終指向生成的單鏈表的最后一個節(jié)點(diǎn)
		}

		i++;
	}

	head=h;
	return h;
}

/*
nodetype* List::creatlist (int n)       //創(chuàng)建鏈表
{
	nodetype *h=NULL;
	int i=1;

	for(int j=0; j<n; j++)
	{
		h=insnode(0);
	}
	head=h;
	return h;
}
*/

void List::readstr(FILE *f,char *string)
{	
	do
	{
						   //①: 先讀入一行文本
		fgets(string, 255, f);  //fgets(): 從文件 f 讀入長度為 255-1 的字符串
						   //		  并存入到 string 中
	} while ((string[0] == '/') || (string[0] == '\n'));

	return;
}

nodetype* List::load()
{
	FILE *fp;
	nodetype *p;
	char c[255];
	int num;
	if((fp=fopen("student.txt", "r"))==NULL)
	{
		cout<<"打開文件失敗"<<endl;
		return 0;
	}
	readstr(fp, c);
	sscanf(c, "The Length Of Link: %d", &num);		//獲取鏈表長度

	p=creatlist(num);								//創(chuàng)建鏈表

	for(int i=0; i<num; i++)
	{
		readstr(fp, c);
		strcpy(p->address, c);
		readstr(fp, c);
		strcpy(p->birthday, c);

		readstr(fp, c);
		strcpy(p->sc.num, c);
		readstr(fp, c);
		strcpy(p->sc.chinese, c);
		readstr(fp, c);
		strcpy(p->sc.english, c);
		readstr(fp, c);
		strcpy(p->sc.math, c);
		readstr(fp, c);
		strcpy(p->sc.physics, c);

		readstr(fp, c);
		strcpy(p->pe.name, c);
		readstr(fp, c);
		strcpy(p->pe.sex, c);
		readstr(fp, c);
		strcpy(p->pe.GJ, c);
		readstr(fp, c);
		strcpy(p->pe.MZ, c);
		readstr(fp, c);
		strcpy(p->pe.XL, c);

		readstr(fp, c);
		strcpy(p->te.SJ, c);
		readstr(fp, c);
		strcpy(p->te.JD, c);
		readstr(fp, c);
		strcpy(p->te.XD, c);

		p=p->next;
	}

	fclose(fp);

	return p;
}

void List::dispnode(nodetype* p)		//顯示一個學(xué)生的所有信息
{
	if(p!=NULL)
	{
		dispperson(p);
		dispscore(p);
		disptelephone(p);
	}
}

void List::dispname()		//顯示所有學(xué)生姓名
{
	nodetype* p=head;
	cout<<"現(xiàn)有的學(xué)生:  "<<endl;
	if(p==NULL)
		cout<<"沒有任何學(xué)生數(shù)據(jù)"<<endl;
	while(p!=NULL)
	{
		cout<<"姓名:	"<<p->pe.name;

		p=p->next;
	}
}

int List::listlen()       //返回鏈表長度
{
	int i=0;
	nodetype* p=head;
	while(p!=NULL)
	{
		p=p->next;
		i++;
	}
	return i;
}

nodetype* List::findnode (int i)      //通過查找序號返回節(jié)點(diǎn)的指針
{
	nodetype* p=head;
	int j=1;
	if( i>listlen()||i<=0 )          // i 上溢或下溢
		return NULL;
	else
	{
		while( p!=NULL &&  j<i )    //查找第 i 個節(jié)點(diǎn)并由 p 指向該節(jié)點(diǎn)
		{
			j++;
			p=p->next;
		}
		return p;
	}
}

nodetype* List::find(char c[])      //通過查找姓名返回節(jié)點(diǎn)的指針
{
	nodetype* p=head;
	int j=1;
	strcat(c, "\n");				//從外部讀入的字符串末尾都帶了一個換行符
	while( p!=NULL &&  !(check(c, p->pe.name)))    //查找第 i 個節(jié)點(diǎn)并由 p 指向該節(jié)點(diǎn)	
	{	
		j++;	
		p=p->next;
	}
	return p;
}

int List::find2(char c[])      //通過查找姓名返回節(jié)點(diǎn)的序號
{
	nodetype* p=head;
	int j=1;
	strcat(c, "\n");				//從外部讀入的字符串末尾都帶了一個換行符
	while( p!=NULL &&  !(check(c, p->pe.name)))    //查找第 i 個節(jié)點(diǎn)并由 p 指向該節(jié)點(diǎn)	
	{	
		j++;
		p=p->next;
	}
	return j;
}

nodetype* List::insnode(int i)
{
	nodetype *h=head, *p, *s;
	s=(nodetype*)malloc(sizeof(nodetype));    //創(chuàng)建節(jié)點(diǎn) s
	s->next=NULL;
	if(i==0)           //i=0 時 s 作為該單鏈表的第一個節(jié)點(diǎn)
	{
		s->next = h;
		h=s;           //重新定義頭節(jié)點(diǎn)
	}
	else
	{
		p=findnode(i);       //查找第 i 個節(jié)點(diǎn)，并由 p 指向該節(jié)點(diǎn)
		if(p!=NULL)
		{
			s->next=p->next;
			p->next=s;
		}
		else cout<<"輸入的 i 值不正確"<<endl;
	}
	head=h;

	return s;
}

void List::delnode(int i)			//刪除第 i 個節(jié)點(diǎn)
{
	nodetype *h=head, *p=head, *s;
	int j=1;
	if(i==1)       //刪除第一個節(jié)點(diǎn)
	{
		h=h->next;
		free(p);
	}
	else
	{
		p=findnode(i-1);     //查找第 i-1 個節(jié)點(diǎn)，并由 p 指向這個節(jié)點(diǎn)
		if(p!=NULL && p->next!=NULL)
		{
			s=p->next;      // s 指向要刪除的節(jié)點(diǎn)
			p->next=s->next;
			free(s);
		}
		else
			cout<<"輸入的 i 值不正確"<<endl;
	}
	head=h;
}

void List::editperson(nodetype* p)
{
	char c[100];
	cout<<"請輸入姓名: "<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->pe.name, c);

	cout<<"請輸入性別："<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->pe.sex, c);

	cout<<"請輸入生日（格式舉例：1982-1-1）: "<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->birthday, c);

	cout<<"請輸入民族："<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->pe.MZ, c);

	cout<<"請輸入國籍："<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->pe.GJ, c);

	cout<<"請輸入學(xué)歷："<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->pe.XL, c);

	cout<<"請輸入家庭住址（例如：廣西玉林市解放路11號"<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->address, c);

	cout<<"編輯個人信息完成!"<<endl;

	dispperson(p);
}

void List::editscore(nodetype* p)
{
	char a[50];
	cout<<"請輸入學(xué)號: "<<endl;
	cin>>a;
	strcat(a, "\n");
	strcpy(p->sc.num, a);

	cout<<"請輸入大學(xué)語文成績: "<<endl;
	cin>>a;
	strcat(a, "\n");
	strcpy(p->sc.chinese, a);

	cout<<"請輸入英語成績: "<<endl;
	cin>>a;
	strcat(a, "\n");
	strcpy(p->sc.english, a);

	cout<<"請輸入數(shù)學(xué)成績: "<<endl;
	cin>>a;
	strcat(a, "\n");
	strcpy(p->sc.math, a);

	cout<<"請輸入物理成績: "<<endl;
	cin>>a;
	strcat(a, "\n");
	strcpy(p->sc.physics, a);

	cout<<"編輯學(xué)科成績完成!"<<endl;

	dispscore(p);
}

void List::edittelephone(nodetype* p)
{
	char c[50];
	cout<<"請輸入手機(jī)號碼: "<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->te.SJ, c);

	cout<<"請輸入家庭電話號碼: "<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->te.JD, c);

	cout<<"請輸入學(xué)校電話號碼: "<<endl;
	cin>>c;
	strcat(c, "\n");
	strcpy(p->te.XD, c);

	cout<<"編輯聯(lián)系方式完成!"<<endl;

	disptelephone(p);
}

void List::dispperson(nodetype* p)
{
	cout<<"姓名:		"<<p->pe.name;
	cout<<"性別:		"<<p->pe.sex;
	cout<<"民族:		"<<p->pe.MZ;
	cout<<"國籍:		"<<p->pe.GJ;
	cout<<"學(xué)歷:		"<<p->pe.XL;
	cout<<"出生日期:	"<<p->birthday;
	cout<<"家庭住址:	"<<p->address;
}

void List::dispscore(nodetype* p)
{
	cout<<"學(xué)號:		"<<p->sc.num;
	cout<<"大學(xué)語文成績:	"<<p->sc.chinese;
	cout<<"英語成績:	"<<p->sc.english;
	cout<<"數(shù)學(xué)成績:	"<<p->sc.math;
	cout<<"物理成績:	"<<p->sc.physics;
}

void List::disptelephone(nodetype* p)
{
	cout<<"手機(jī)號碼是:	"<<p->te.SJ;
	cout<<"家庭電話是:	"<<p->te.JD;
	cout<<"學(xué)校電話是:	"<<p->te.XD;
}

void List::help()
{
	cout<<endl<<endl;
	cout<<"*********************************************************"<<endl;
	cout<<"1:			編輯個人信息"<<endl;
	cout<<"2:			編輯學(xué)科成績"<<endl;
	cout<<"3:			編輯聯(lián)系方式"<<endl;
	cout<<"4:			顯示個人信息"<<endl;
	cout<<"5:			顯示學(xué)科成績"<<endl;
	cout<<"6:			顯示聯(lián)系方式"<<endl;
	cout<<"7:			顯示該學(xué)生所有信息"<<endl;
	cout<<"8:			幫助菜單"<<endl;
	cout<<"9:			返回上一級菜單"<<endl;
	cout<<"*********************************************************"<<endl;
}

List::~List()
{
	nodetype *pa=head, *pb;
	if(pa!=NULL)
	{
		pb=pa->next;
		if(pb==NULL)
			free(pa);
		else
		{
			while(pb!=NULL)
			{
				free(pa);
				pa=pb;
				pb=pb->next;
			}
			free(pa);
		}
	}
}