C++模板类实现顺序表

#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
using namespace std;
#include <assert.h>

#define length 10

typedef int DataType;

class Vector
{
public:
	// 构造函数
	explicit Vector(size_t capacity = 100)       //若不给缺省值，注意初始化的顺序
		:_pData(new DataType[_capacity])     //因为_pData的初始化对使用_capacity
		, _size(0)
		, _capacity(100)
	{ }



	// 构造函数--有size个值为data的元素
	Vector(size_t n, const DataType& data)
	{
		_size = n;
		_capacity = 100;
		_pData = new DataType[length];
		size_t i = 0;
		for (; i < _size; i++)
		{
			_pData[i] = data;
		}
	}



	//拷贝构造函数
	Vector(const Vector& v)
		: _capacity(v._capacity)                             
		, _size(v._size)	                                 
	{                                                        
		_pData = new DataType[v._capacity];
		for (size_t idx = 0; idx < _size; ++idx)
			_pData[idx] = v._pData[idx];
	}



	//析构函数
	~Vector()
	{
		delete[] _pData;
		_pData = NULL;
		_size = 0;
		_capacity = 0;
	}



	// = 的重载函数
	Vector& operator=(const Vector& v)
	{
		_pData = new DataType[v._capacity];
		_size = v._size;
		for (int i = 0; i < (int)_size; i++)
		{
			_pData[i] = v._pData[i];
		}
		return *this;
	}



	//尾插函数
	void PushBack(const DataType& data)
	{
		if (_size < _capacity)
		{
			_pData[_size] = data;
			_size++;
		}
		else
		{
			int i = 0;
			DataType* tmp = new DataType[_capacity + length];
			for (; i < (int)_size; i++)
			{
				tmp[i] = _pData[i];
			}
			tmp[i] = data;
			_size = i;
			_pData = tmp;
			delete[] tmp;
			tmp = NULL;
		}
	}



	//尾删函数
	void PopBack()
	{
		if (_pData)
		{
			if (_size > 1)
			{
				_size--;
			}
			else
			{
				delete[] _pData;
				_size = 0;
			}
		}
	}



	//插入指定位置、指定数据函数
	void Insert(size_t pos, const DataType& data)               //注意下标和_size的 
	{
		assert(pos > 0 && pos <= _size);
		int idx = 0;
		if (_size >= _capacity)       //插入时顺序表已满，则开辟更大的空间继续插入
		{
			int i = 0;
			DataType* tmp = new DataType[_capacity + length];
			for (; i < (int)_size; i++)
			{
				tmp[i] = _pData[i];
			}
			_pData = tmp;
			delete[] tmp;
			tmp = NULL;
		}
		size_t tmp = _size;
		for (tmp; tmp >= pos; tmp--)
		{
			_pData[tmp] = _pData[tmp - 1];
		}
		_pData[pos - 1] = data;
		_size++;
	}


	//删除指定节点函数
	void Erase(size_t pos)
	{
		size_t tmp = _size;
		if (_size > 0)
		{
			int idx = 0;
			for (pos; pos < tmp; pos++)
			{
				_pData[pos-1] = _pData[pos];
			}
			_size--;
		}
	}



	//查找函数
	int Find(const DataType& data)const            
 //注意下标和_size的关系

{int idx = 0;for (idx = 0; idx < (int)_size; idx++){if (data == _pData[idx]){break;}}return idx + 1;}//清空函数void Clear(){_size = 0;_capacity = 0;delete[] _pData;_pData = NULL;}//求长度函数size_t Size()const{return _size;}//给当前顺序表上加上size个data数据void ReSize(size_t size,
 const DataType& data = DataType()){size_t max = _size + size;for (_size; _size < max; _size++){_pData[_size] = data;}}//求最大容量函数size_t Capacity()const{return _capacity;}//判空函数bool Empty()const{if (0 == _size)return true;elsereturn false;}//返回第一个节点的数据DataType&
 Front(){if (_size > 0){return _pData[0];}}const DataType& Front()const{if (_size > 0){return _pData[0];}}//返回最后一个节点的数据DataType& Back(){if (_size > 0){return _pData[_size-1];}}const DataType& Back()const{if (_size > 0){return _pData[_size - 1];}}//置数函数void
 Assign(size_t n, const DataType& data = DataType()){int idx = 0;for (idx=0; idx < (int)n; idx++){_pData[idx] = data;}_size = idx;}//[]的重载函数DataType& operator[](size_t index){if (_size > 0){return _pData[index];}}const DataType& operator[](size_t index)const{if
 (_size > 0){return _pData[index];}}DataType& At(size_t index){if (_size > 0){return _pData[index];}}const DataType& At(size_t index)const{if (_size > 0){return _pData[index];}}private://判断容量是否已满bool _CheckCapacity(){if (_size < _capacity){return true;}elsereturn
 false;}// <<的重载函数friend std::ostream& operator<<(std::ostream& _cout, const Vector& v);private:DataType* _pData;size_t _capacity;size_t _size;};std::ostream& operator<<(std::ostream& os, const Vector& v){int idx = 0;for (idx = 0; idx < (int)v._size; idx++){os
 << v._pData[idx];cout << " ";}return os;}int main(){Vector v1(5,1);v1[1] = 2;v1[2] = 3;v1[3] = 4;v1[4] = 5;Vector v2;v2 = v1;Vector v3(v1);cout << "v1 = " << v1 << endl;cout << "v2 = " << v2 << endl;cout << "v3 = " << v3 << endl;


        //以下都是对上述代码逻辑的实验：
	v1.PushBack(6);
	cout << "v1尾插6" << endl;
	cout << "v1 = " << v1 << endl;

	v2.PopBack();
	cout << "v2尾删一个数" << endl;
	cout << "v2 = " << v2 << endl;

	cout << "v2在第二个位置插上数据‘0’"<< endl;
	v2.Insert(2, 0);
	cout << "v2 = " << v2 << endl;

	cout << "v2删除第三个位置上的数据‘2’" << endl;
	v2.Erase(3);
	cout << "v2 = " << v2 << endl;

	cout << "在v1中查询数据‘2’的位置并返回" << endl;
	v1.Find(2);
	cout << "v1中数据‘2’的位置位为：" << v1.Find(2) << endl;

	cout << "清空v3的数据" << endl;
	v3.Clear();
	cout << "v3 = " << v3 << endl;

	cout << "v1的长度为：" << v1.Size() << endl;

	v2.ReSize(3, 6);
	cout << "给v2上加 3 个 6 " << endl;
	cout << "v2 = " << v2 << endl;

	cout << "v1的最大容量:" << v1.Capacity() << endl;

	cout << "返回v1的第一个数据:" << v1.Front() << endl;

	cout << "返回v1的最后一个数据:" << v1.Back() << endl;

	system("pause");
	return 0;
}



// 本博客中如有任何不准确之处请在评论区留言，我会及时更正