#include<iostream>
#include<malloc.h>
#include"linkedlist.cpp"
using namespace std;
void f_1(void);
void f_2(void);
void f_3(void);
void f_4(void);
void f_5(void);
void f_6(void);
void f_7(void);

LinkedList L;

void f_1(void)
{
	int x;
	cout<<"                    請(qǐng)輸入數(shù)據(jù):";
	cin>>x;
	L.InsertRear(x);  
}
void f_2(void)
{
	int x;
	Node *p;
	cout<<"                    請(qǐng)你輸入你要訪問(wèn)的結(jié)點(diǎn)序號(hào):";
    cin>>x;
	p=L.Locate(x);
	if(p==NULL)
	cout<<"                    輸入有誤"<<endl;
    else
	cout<<"                    第"<<x<<"結(jié)點(diǎn)值為"<<p->Num<<endl;
}
void f_3(void)
{
	cout<<"                    表中最大數(shù)為 "<<L.max()->Num<<endl;
}
void f_4(void)
{
	int x,y;
	cout<<"                   請(qǐng)你輸入你要統(tǒng)計(jì)的數(shù):";
    cin>>x;
	y=L.number(x);
	cout<<"                    "<<x<<"在表中出現(xiàn)"<<y<<"次"<<endl;
}
void f_5(void)
{
	int i,n;
	int *a;
	cout<<"                     請(qǐng)輸入數(shù)組大小:";
	cin>>n;
    a=(int *)malloc(n*sizeof(int));
	if(a==NULL)
	{
		cout<<"no enough memory"<<endl;
		return ;
	}
	cout<<"                     請(qǐng)輸入"<<n<<"個(gè)數(shù):";
	for(i=0;i<10;i++)
    cin>>a[i];
	L.create(a,n);
	cout<<"                     輸入完畢";
	free(a); 
}
void f_6(void)
{
    L.tidyup();
	cout<<"                操作完畢"<<endl;
}
void f_7(void)
{ L.OutAll(); cout<<endl;}
void main()
{
	
	int n;
    cout<<"                __________________________________________"<<endl
        <<"               |              連表程序                    |"<<endl
		<<"               | 姓名:卡米力江         學(xué)號(hào):0610210010    |"<<endl
		<<"                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ "<<endl;
	
	while(1)
	{		
		cout<<endl<<endl
			<<"                         請(qǐng)嚴(yán)格按下列操作做 "<<endl
			<<"============================================================================="<<endl
		    <<" 1.輸入數(shù)據(jù)                       "<<endl
	    	<<" 2.訪問(wèn)結(jié)點(diǎn)                       "<<endl
		    <<" 3.求表中最大值                   "<<endl
		    <<" 4.統(tǒng)計(jì)某個(gè)值在表中的出現(xiàn)次數(shù)     "<<endl
		    <<" 5.按數(shù)組生成對(duì)應(yīng)的連表           "<<endl
		    <<" 6.刪除重復(fù)的多余數(shù)據(jù)             "<<endl
		    <<" 7.輸出連表中所有的數(shù)             "<<endl
			<<" 8.退出程序                       "<<endl
            <<"==================請(qǐng)選擇你要的操作:";
 	    cin>>n;
		cout<<endl<<"---------------------------------------"<<endl;
    	switch(n)
		{
    	case 1: f_1(); break;
		case 2: f_2(); break;
        case 3: f_3(); break;
		case 4: f_4(); break;
		case 5: f_5(); break;
		case 6: f_6(); break;
		case 7: f_7(); break;
		case 8: exit(1);
		}
	}
}