10.08数据结构

#include<iostream>
using namespace std;
int main (){
	int i,j;
	j=0;
	int a[6];
	while(a[j]=0){
		cin>>i;
		a[j]=i;
		j+=1;
	}
	delete a[j];
	i=0;
	while(i<=6){
		if(a[i])
		
}
template <class T>
class LinkList{
	public:
		LinkList(){fist=new Node;first->next=NULL;}
		LinkList{T a[],int n};
		~LinkList();
		int Length();
		T Get(int);
		int Locate(T x);
		void insert(int i,T x);
		T Delete(int i);
		void PrintList();
	private:
		Node<T>*first;
};
template<class T>
LinkList<T>::LinkList{T a[],int n)
{
	first=new Node<T>;
	first->next=NULL;
	Node<T>*s;
	for(int i=0;i<n;i++)
	{
		s=new Node<T>;
		s->data=a[i];
		s->next=first->next;
		first->next=s;
	}
}