顺序表

//2016.9.4
#include <iostream>
#include <cstdio>

using namespace std;

const int maxsize = 100;

template<class T>
class seq_list
{
protected:
    T *date;
    int max_size;
    int last;
public:
    seq_list(int ms = maxsize);
    seq_list(seq_list<T> &a);
    ~seq_list(){delete [] date;}
    int Length(){return last;}
    bool Empty(){return last == 0;}
    bool Full(){return last == maxsize;}
    bool getDate(int pos, T &val) const
    {if(pos>=0&&pos<last){val = date[pos]; return true;}else return false;}
    bool Insert(int pos, T val);
    bool Remove(int pos, T& val);
    bool Update(int pos, T val);
    bool Search(T x);
    void output(){
        for(int i = 0; i < last; i++)
              cout<<date[i]<<" ";
        cout<<endl;
    }
    seq_list<T> operator=(seq_list<T> &a);
};

template<class T>
seq_list<T>::seq_list(int ms)
{
    if(ms > 0)
    {
        max_size = ms;
        last = 0;
        date = new T[max_size];
        if(date == NULL)exit(1);
    }
}

template<class T>
seq_list<T>::seq_list(seq_list<T> &a)
{
    T tmp;
    max_size = a.max_size, last = a.last;
    date = new T[max_size];
    if(date == NULL)exit(1);
    for(int i = 0; i < last; i++)
    {
        a.getDate(i, tmp);
        date[i] = tmp;
    }
}

template<class T>
bool seq_list<T>::Insert(int pos, T val)
{
    if(last == max_size)return false;
    if(pos<0 || pos>last)return false;
    for(int i = last; i > pos; i--)
          date[i] = date[i-1];
    date[pos] = val;
    last++;
    return true;
}

template<class T>
bool seq_list<T>::Remove(int pos, T& val)
{
    if(pos<0 || pos >= last)return false;
    if(last == 0)return false;
    val = date[pos];
    for(int i = pos; i < last; i++)
          date[i] = date[i+1];
    last--;
}

template<class T>
bool seq_list<T>::Update(int pos, T val)
{
    if(pos<0 || pos>=last)return false;
    date[pos] = val;
    return true;
}

template<class T>
bool seq_list<T>::Search(T x)
{
    for(int i = 0; i < last; i++)
          if(date[i] == x)
            return true;
    return false;
}

template<class T>
seq_list<T> seq_list<T>::operator=(seq_list<T> &a)
{
    delete [] date;
    max_size = a.max_size, last = a.last;
    date = new T[max_size];
    if(date == NULL)exit(1);
    T tmp;
    for(int i = 0; i < last; i++)
    {
        a.getDate(i, tmp);
        date[i] = tmp;
    }
}

void Union(seq_list<int> &a, seq_list<int> &b)//两个集合的并
{
    int n = a.Length(), m = b.Length(), tmp;
    for(int i = 0; i < m; i++)
    {
        b.getDate(i, tmp);
        if(!a.Search(tmp))
        {
            a.Insert(n, tmp);
            n++;
        }
    }
}

void Intersection(seq_list<int> &a, seq_list<int> &b)//两个集合的交
{
    int n = a.Length(), tmp;
    for(int i = 0; i < n; i++)
    {
        a.getDate(i, tmp);
        if(!b.Search(tmp))
              a.Remove(i, tmp);
    }
}

int main()
{
    int tmp;
    seq_list<int> a;
    for(int i = 0; i < 10; i++)
          a.Insert(i, i);
    a.output();
    a.Insert(1, 100);
    a.output();
    a.Remove(1, tmp);
    a.output();
    if(a.Search(5))cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    seq_list<int> b;
    b = a;
    b.output();
    b.Update(5, 500);
    b.output();
    Union(a, b);
    a.output();
    Intersection(a, b);
    a.output();
    return 0;
}