C++——仿照vector，实现MyVector

#include <iostream>
#include<vector>
using namespace std;

template <typename T>
class myvector
{
private:
    T *first;
    T *last;
    T *end;
public:
    //无参构造
    myvector(){
        first = new T[1];
        last = first;
        end = first+1;
    }
    //有参构造
    myvector(int num,const T &val){
        first = new T[num + 1];
        last = first;
        end = first+num;
        for(int i = 0; i < num; ++i){
            first[i] = val;
            last++;
        }
    }
    //拷贝构造
    myvector(const myvector<T> *other){
       this->first = new T[other->end - other->first +1];
       this->last = other->last;
        this->end = other->end;
        for(int i = 0;i < other->end - other->first ;i++){
            this->first[i] = other->first[i];
            last+=1;
        }
        end+=(other->end-other->first);

    }
    //拷贝赋值
    myvector &operator=(const myvector<T> *other){
        if(this!=&other){
            delete [] first;
            this->first = new T[other->end - other->first +1];
            this->last = other->last;
             this->end = other->end;
             for(int i = 0;i < other->end - other->first ;i++){
                 this->first[i] = other->first[i];
              }
        }
             return *this;
    }
    ~myvector(){
        delete [] first;
        first = nullptr;
        last = nullptr;
        end = nullptr;
    }
    //at（）函数
    T &at(int pop){
        if(pop < 0 || pop >end - first){
            throw -1;
        }
        return first[pop];
    }
    const T &operator[](const int pos)const{
        return first[pos];
    }
    //判空函数
    bool empty(){
        if(last ==first)
            return true;
         else
            return false;
    }
    //判满函数
    bool full(){
        return last == end;
    }
    //front函数 返回第一个元素的地址
    T &front(){
        return *first;
    }
    //back函数 返回最后一个元素的地址
    T &back(){
        return *(end - 1);
    }
    //size（）函数
     int size() const{
        return last - first;
    }
     //clesr函数
     void clear(){
         last = first;
     }
     //expand（）二倍扩容
     void expand(){
         int n = last -first;
         T *temp = new T[(end - first)*2];
         for(int i = 0; i < last -first;++i ){
             temp[i]=first[i];
         }
         delete [] first;
         first = temp;
         last = first + n;
         end = first + 2 *(end - first);
         temp = nullptr;
     }
     //push_back()将val值插入末尾
     void push_back(const T &val){
         if(full())
             expand();
         *last = val;
         last+=1;
     }
    //删除
     void pop_back(){
         if(empty()){
             throw -1;
         }
         last--;
     }

};

int main()
{
    myvector<int> v1(3,5);
    for(int i = 0;i < v1.size();i++){
        cout<<v1[i]<<" ";
    }
    cout<<endl;
    myvector<int>v2(v1);
    cout<<v2.at(2)<<endl;
    cout<<"v2.size =" <<v2.size()<<endl;
    myvector<int> v3(v2);
   // v3 = v2;

    for(int i = 0;i < v3.size();++i){
        cout<<v3[i]<<" ";
    }
    cout<<endl;
    cout<<v3.size()<<" ";

    cout<<"v2=" <<v2.size()<<" ";
    v3.clear();
    cout<<"v2=" <<v2.size()<<" ";
    cout<<"v3.size = "<<v3.size()<<endl;

    if(v3.empty()){
       cout<<" v3容器已空"<<endl;
    }else {
        cout<<"容器 非空"<<endl;
    }

        v2.push_back(1);
        v2.push_back(6);
cout<<"v2=" <<v2.size()<<" ";
        cout<<v2.size()<<endl;
        for(int i = 0;i <v2.size();++i){
            cout<<v2[i]<<endl;
        }





    return 0;
}