链表操作

#include<iostream.h>
class sqlist
{
private:
	int count,maxsize;
	char *elem;
public:
	sqlist(int size)
	{
		maxsize=size;
		elem=new char[maxsize];
		count=0;
	}
	void inputlist()
	{
		char temp;
		int n;
		for(int i=0;i<maxsize;i++)
		{
			cout<<"若要停止输入，按-1，否则按1"<<endl;
			cin>>n;
			if(n==-1)
				break;
			else
			{
				cout<<"请输入元素"<<endl;
				cin>>temp;
				elem[i]=temp;
				count++;
			}
		}
	}
	int length()
	{
		return count;
	}
	void outputlist()
	{
		for(int i=0;i<length();i++)
			cout<<elem[i]<<endl;
	}
	bool empty()
	{
		return count!=0;
	}
	void thirdelem()
	{
       cout<<"此顺序表的第三个元素为"<<elem[2]<<endl;
	}
	void outputelem()
	{
		for(int i=0;i<length();i++)
		{
			if(elem[i]='a')
			{
				cout<<"a的位置为第"<<i+1<<endl;
			    break;
			}
			else
				continue;
		}
	}
	void delethirdelem()
	{
		char tem;
		for(int i=3;i<length();i++)
		{
			tem=elem[i];
			elem[i-1]=tem;
		}
		count--;
	}
	void insertforth(int m,char &b)
	{
		count++;
		char tem;
		for(int k=length();k>=m;k--)
		{
			tem=elem[k-1];
			elem[k]=tem;
		}
		elem[m-1]=b;
		
	}
	
};
void main()
{
	int size1;
	char ch1='f';
	cout<<"输入链表的最大容量"<<endl;
	cin>>size1;
	sqlist list(size1);
	list.inputlist();
	cout<<"此顺序表的长度为"<<list.length()<<endl;
	cout<<"此顺序表是否为空"<<"  "<<list.empty()<<endl;
	list.thirdelem();
	list.outputelem();
	cout<<"将f插入此顺序表的第四个位置后为"<<endl;
	list.insertforth(4,ch1);
	cout<<"此顺序链表的内容为"<<endl;
	list.outputlist();
	cout<<"此链表删除第三个元素后为"<<endl;
	list.delethirdelem();
	list.outputlist();
}