C++ 順序表 代碼實現

 

線性表存儲在計算機中可以采用多種方式，以下是按照順序存儲方式實現：

優點：查找很方便

缺點：插入元素、刪除元素比較麻煩，時間復雜度 O(n)

#ifndef SeqList_h
#define SeqList_h
#include <iostream>
using namespace std;
const int MAXSIZE = 1000;
template <class T>
class SeqList{
public:
    SeqList(){length = 0;}  //初始化 10     SeqList(const T a[], int n); //初始化 11     int GetLength(){return length;}  //獲取長度 12     void PrintList();  //打印 13     void Insert(int i, T x);  //插入 14     T Delete(int i); //刪除 15     T Get(int i);  //獲取 16     int Locate(T x);  //按值查找 17 private:
    int length;
    T data [MAXSIZE];
    
};
template <class T>
SeqList<T>::SeqList(const T a[], int n){
    if(n>MAXSIZE){
        throw "數組長度超過順序表的最大長度";
    }
    for(int i = 0;i<n;i++){
        data[i] = a[i];
    }
    length = n;
}
template <class T>
void SeqList<T>::PrintList(){
    cout<<"按序號依次遍歷線性表中的各個數據元素："<<endl;
    for(int i = 0;i<length;i++){
        cout << data[i] <<" ";
    }
    cout << endl;
}
template <class T>
void SeqList<T>::Insert(int i, T x){
    if(length>MAXSIZE) throw "上溢異常";
    if(i<0 || i>length-1) throw "位置異常";
    for(int j = length; j>=i; j--){
        data[j] = data[j-1];
    }
    data[i-1] = x;
    length ++;
}
template <class T>
T SeqList<T>::Delete(int i){
    if(length == 0) throw "下溢異常";
    if(i<1 || i>length){
        throw "位置異常";
    }
    T x = data[i-1];
    for(int j = i-1;j<length-1;j++){
        data[j]= data[j+1];
    }
    length --;
    return x;
}
template <class T>
T SeqList<T>::Get(int i){
    if(0 == length) throw"上溢異常";
    if(i<1 || i>length){
        throw "查找位置非法";
    }
    return data[i-1];
}
template <class T>
int SeqList<T>::Locate(const T x){
    for(int i = 0;i<length;i++){
        if(x == data[i])
            return i+1;
    }
    return 0;
}
#endif /* SeqList_h */