C++�?-�U�性表

星梦情缘 — Thu, 07 Jun 2007 11:44:00 GMT

#include "head.h"
#include "iostream.h"

#define LIST_INIT_SIZE 100

template
class SqList
{
private:
   ElemType *elem;
   int length;
      int listsize;
public:
   SqList(int max=LIST_INIT_SIZE);
   ~SqList(){delete[] elem;}
      void ClearList();
      Status input(int n);
      Status output();
      Status ListEmpty();
      int    ListLength();
      ElemType GetElem(int i);
      Status NextElem(ElemType i,ElemType &next_e);
      Status ListInsert(int i,ElemType e);
      Status ListDelete(int i,ElemType &e);
   Status inver();// 逆置
      //Status MergeList(SqList La,SqList Lb);
};
template SqList::SqList(int max)
{
listsize=max;
length=0;
elem=new ElemType[listsize];
};
template void SqList::ClearList()
{
delete[] elem;
elem=new ElemType[listsize];
length=0;
};
template Status SqList::input(int n)
{
if(n<=0) return ERROR;
for(int i=0;i {
    cout<<"输入�W?< cin>>elem[i];
}
length=n;
return OK;
};
template Status SqList::output()
{
if(length==0) return ERROR;
else
{
    for(int i=0;i {
   cout<";
}
cout<<"NULL"< }
return OK;
};
template Status SqList::ListEmpty()
{
if(length==0) return TRUE;
   else return FALSE;
};
template int SqList::ListLength()
{
return length;
};
template ElemType SqList::GetElem(int n)
{
ElemType e;
if(length==0) return ERROR;
if(n<1||n>ListLength()) return OVERFLOW;
e=elem[n-1];
return e;
};
template Status SqList::NextElem(ElemType loc_e,ElemType &next_e)
{
if(length==0) return ERROR;
for(int i=1;loc_e!=elem[i-1];i++);
if(i==length) return OVERFLOW;
next_e=elem[i];
return OK;
};
template Status SqList::ListInsert(int i,ElemType e)
{
if(i<1||i>length) return ERROR;
if(listsize==length) return OVERFLOW;
for(int n=length-1;n>=i-1;n--)
   elem[n+1]=elem[n];
elem[i-1]=e;
length++;
return OK;
};
template Status SqList::ListDelete(int i,ElemType &e)
{
if(i<1||i>length) return ERROR;
e=elem[i-1];
for(int n=i-1;n   elem[n]=elem[n+1];
length--;
return OK;
};
template Status SqList::inver()
{
int i,m,n;
ElemType temp;
n=length;
m=n/2;
for(i=0;i {
    temp=elem[i];elem[i]=elem[n-i-1];elem[n-i-1]=temp;
}
return OK;
};

星梦情缘 2007-06-07 19:44 发表评论

星梦情缘 — Wed, 06 Jun 2007 15:42:00 GMT

摘要: 复数的实现程�?nbsp; 阅读全文

星梦情缘 2007-06-06 23:42 发表评论

久久久无码精品亚洲日韩蜜臀浪潮,久久亚洲国产成人精品无码区,久久久久人妻一区精品果冻

C++�?-�U�性表