数据结构单链表基本功能c++实现

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 1005
using namespace std;
typedef int T;
template<class T>
struct node
{
    int data;
    node <int> *next;
};
class LinkList
{public:
    LinkList();
    LinkList(int a[],int n);
    ~LinkList();
    int Length();
    int Get(int i);
    int Locate(int i);
    void Insert(int i,int x);
    int Delete(int i);
    void PrintList();
private:
    node<int>*first;

};
void LinkList::PrintList()//输出链表
{node<int>*p;
    p=first->next;
    while(p)
    {
        printf("%d ",p->data);
        p=p->next;
    }
    printf("\n");
}
int LinkList::Length()//长度
{node<int>*p;
    p=first->next;
    int count=0;
    while(p)
    {
        count++;
        p=p->next;
    }
    return count;
}

LinkList::LinkList()//无参构造函数
{
    first=new node<int>;
    first->next=NULL;

}
int LinkList::Get(int i)//按位查找
{
    node<int>*p;
    p=first->next;
    int count=1;
    while(p&&count<i)
    {

        p=p->next;
        count++;
    }
    if(p==NULL)
    throw "位置";
    else
        return p->data;


}
int LinkList::Locate(int x)//按值查找
{
    node<int>*p;
    p=first->next;
    int count=1;
    while(p)
    {if(p->data==x)
    break;
        p=p->next;
        count++;
    }
    return count;
}
void LinkList::Insert(int i,int x)//插入
{
    node<int>*p;
    node<int>*s;
    p=first;
    int count=0;
    while(p&&count<i-1)
    {
        p=p->next;
        count++;
    }
    if(p==NULL)
        throw "位置";
    else
        {s=new node<int>;
        s->data=x;
         s->next=p->next;
         p->next=s;
        }
}
int LinkList::Delete(int i)//删除
{
    node<int>*p;
    node<int>*s;
    node<int>*q;
    int x;
    int count=0;
    p=first;
    while(p!=NULL&&count<i-1)
    {
        p=p->next;
        count++;
    }
    if(p==NULL||p->next==NULL)
    throw"位置";
    else
    {q=p->next;
    x=q->data;
        p->next=q->next;
        delete q;
    }
    return x;

}
/*LinkList::LinkList(int a[],int n)//头插法构造
{
    first=new node<int>;
    first->next=NULL;
    node<int>*s;
    for(int i=0;i<n;i++)
    {
        s=new node<int>;
        s->data=a[i];
        s->next=first->next;
        first->next=s;
    }
}*/
LinkList::LinkList(int a[],int n)//尾插法构造
{
    node<int>*r;
    first=new node<int>;
    r=first;
    node<int>*s;
    for(int i=0;i<n;i++)
    {
        s=new node<int>;
        s->data=a[i];
        r->next=s;
        r=s;
    }
    r->next=NULL;
}
LinkList::~LinkList()//析构函数
{
node<int>*q;
while(first!=NULL)
{
    q=first;
    first=first->next;
    delete q;
}

}
int main()

{
  int a[5]={1,2,3,4,5};
  LinkList l=LinkList();
  l=LinkList(a,5);
  cout<<l.Length()<<endl;
l.PrintList();
cout<<l.Get(2)<<endl;
cout<<l.Locate(3)<<endl;
l.Insert(2,100);
l.PrintList();
cout<<l.Delete(2)<<endl;
l.PrintList();
}

 

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct Node
{

	int data;;
	Node*next;
};
class LinkList
{
public:
	LinkList();
	LinkList(int a[],int n);
        ~LinkList();

	int Length();
	int Get(int i);
	int Locate(int x);
	void Insert(int i,int x);
	int Delete(int i);
	void PrintList();
	int MaxElement();
	int MinElement();
	private:
	Node*first;
};
LinkList::LinkList()
{first=new Node;
first->next=NULL;

}
/*LinkList::LinkList(int a[],int n)
{Node*s;
	first=new Node;
	first->next=NULL;
	for(int i=0;i<n;i++)
	{
		s=new Node;
		s->data=a[i];
		s->next=first->next;
		first->next=s;
	}
}*/
void LinkList::PrintList()
{
	Node*p;
	p=first->next;
	while(p!=NULL)
	{
		cout<<p->data<<" ";
		p=p->next;

	}
	cout<<endl;
}
LinkList::~LinkList()
{
	Node*q;
	while(first!=NULL)
	{
		q=first;
		first=first->next;
		delete q;
	}
}
LinkList::LinkList(int a[],int n)
{
	Node*rear;
	Node*s;
	first=new Node;
	rear=first;
	for(int i=0;i<n;i++)
	{
		s=new Node;
		s->data=a[i];
		rear->next=s;
		rear=s;
	}
	rear->next=NULL;

}
int LinkList::Get(int i)
{
	int count=1;
	Node*p;
	p=first->next;
	while(p!=NULL&&count<i)
	{
		count++;
		p=p->next;
	}
	if(p==NULL)
	throw"位置";
	else return p->data;
}
int  LinkList::Locate(int x)
{
	Node*p;
	int count=1;
	p=first->next;
	while(p!=NULL)
	{
		if(p->data==x)
			return count;
		p=p->next;
		count++;
	}
	return 0;
}
int LinkList::Length()
{
	Node*p;
	p=first->next;
	int count=0;
	while(p!=NULL)
	{
		p=p->next;
		count++;
	}
	return count;
}
void LinkList::Insert(int i,int x)
{
	Node*p;
	Node*s;
	p=first;
	int count=0;
	while(p!=NULL&&count<i-1)
	{
		p=p->next;
		count++;
	}
	if(p==NULL)
		throw "位置";
	else
	{
		s=new Node;
		s->data=x;
		s->next=p->next;
		p->next=s;
	}
}
int LinkList::Delete(int i)
{
	Node*p;
	Node*q;
	p=first;
	int count=0;
	while(p!=NULL&&count<i-1)
	{
		p=p->next;
		count++;
	}
	if(p==NULL||p->next==NULL)
	throw"位置";
	else
        {
		q=p->next;
		int x=q->data;
		p->next=q->next;
		delete q;
		return x;
	}

}
int LinkList::MaxElement()
{
	Node*p;
	p=first->next;
	int maxx=p->data;

	while(p!=NULL)
	{
		if(maxx<p->data)
	       maxx=p->data;
	       p=p->next;
	}
	return maxx;

}
int LinkList::MinElement()
{
	Node*p;
	p=first->next;
	int minn=p->data;
	while(p!=NULL)
	{
		if(minn>p->data)
			minn=p->data;
		p=p->next;
	}
	return minn;
}
int main()
{
	int a[20];
	for(int i=0;i<10;i++)
		cin>>a[i];
	LinkList l1=LinkList(a,10);
	l1.Insert(3,100);
	l1.PrintList();
	cout<<l1.Length()<<endl;
	cout<<l1.Get(2)<<endl;
	cout<<l1.Locate(4)<<endl;
	cout<<l1.Delete(3)<<endl;
	l1.PrintList();
	cout<<l1.MaxElement()<<endl;
	cout<<l1.MinElement()<<endl;
	return 0;
}