线性表—使用数组实现

线性表的功能有：

１)求表的长度

２)按位查找

３)在第i个位置中插入值为n的数

４)删除线性表的第i 个元素

5 )输出线性表

//在头文件中"SeqList.h"
const int MaxSize=100;
#define T float //此处修改　数组的类型
class SeqList
{
public:
    SeqList(){length=0;}
    SeqList(T a[],int n);
    ~SeqList() {}
    int Length(){return length;}
    T Get(int i);
    T Locate(int x);
    void Insert(int i,int x);
    T Delete(int i);
    void PrintList();
private:
    T data[MaxSize];
    int length;
};

//在SwqList.cpp
#ifndef SEQLIST_H_

#define SEQLIST_H_
#include "SeqList.h"
#include<iostream>
using namespace std;
SeqList::SeqList(T *a,int n)
{
    if(n>MaxSize) throw"Parameters of illegal";
    for(int i=0;i<n;i++)
        data[i]=a[i];
    length=n;
}

void SeqList::Insert(int i,int x)
{
    if(length>=MaxSize) throw"overflow";
    if(i<1||i>length+1) throw"malposition";
    for(int j=length;j>=i;j--)
        data[j]=data[j-1];
    data[i-1]=x;
    length++;
}


T SeqList::Delete(int i)
{
    if(length==0) throw "underflow";
   // if(i<1||i>length) "malposition";
    int x=data[i-1];
    for(int j=i;j<length;j++)
        data[j-1]=data[j];
    length--;
    return x;
}

T SeqList::Get(int i)
{
    if(i<1||i>length) throw "malposition";
    else return data[i-1];
}

T SeqList::Locate(int x)
{
    for(int i=0;i<length;i++)
        if(data[i]==x) return i+1;
    return 0;
}

void SeqList::PrintList()
    {
        for(int i=1;i<=length;i++)
        i%10==0?cout<<data[i-1]<<"
":cout<<data[i-1]<<"	";
    };
#endif // SwqList_H_