链表合并

来源：百度知道 编辑：UC知道 时间：2024/05/20 10:40:15
class LinearList
{
public:
LinearList(int MaxListSize=10); //构造函数
~LinearList(){delete[] element;} //析构函数
int Length()const{return length;} //计算长度
LinearList<T>& Merge(const LinearList& A,const LinearList& B); //合并函

LinearList<T>& Insert(int k, const T& x); // insert x just after k'th element

friend istream& operator>>(istream& in,LinearList<T>& x);
void Output(ostream& out)const; //输出
friend ostream& operator<<(ostream& out,const LinearList<T>& x);
private:
int length;
int MaxSize;
T *element;
};
int main()
{
cin>>A;
cout<<"A表为：";
cout<<endl;
cin>>B;

ls说的对，好好看一下书，然后上机调试一些程序，把基础打好。

#include <iostream>

using namespace std;

template <class T>
class LinearList
{
public:
LinearList(int MaxListSize=10) {length=MaxListSize;element=NULL;} //构造函数定义
~LinearList(){delete[] element;}

int Length()const{return length;}

LinearList<T>& Merge(const LinearList& A,const LinearList& B){return *this;} //合并函数的定义呢
LinearList<T>& Insert(int k, const T& x){return *this;} //插入函数的定义呢

void Output(ostream& out)const{}
friend istream& operator>>(istream& in,LinearList<T>& x){return in;} //输入函数的定义呢
friend ostream& operator<<(ostream& out,const LinearList<T>& x){return out;}//输出函数的定义呢
private:
int length;
int MaxSize;
T *element;
};

int main()
{
LinearList<int> A, B, C;
cin&