Myarray.h文件

#pragma once#include<iostream>using namespace std;class MyArray
{
public:MyArray();//默認構造 默認100容量MyArray(int capacity);MyArray(const MyArray& array);~MyArray();//尾插法void Push_Back(int val);//根據索引獲取值int getData(int index);//根據索引設置值void setData(int index, int val);//獲取數組大小int getSize();//獲取數組容量int getCapacity();private:int *pAddress;//指向真正存儲數據的指針int m_Size;//數組的大小int m_Capacity;//數組容量
};

Myarray.cpp

#include"Myarray.h"//默認構造
MyArray::MyArray()
{this->m_Capacity = 100;this->m_Size = 0;this->pAddress = new int[this->m_Capacity];
}
//有參構造 參數 數組容量
MyArray::MyArray(int capacity)
{cout << "有參構造調用" << endl;this->m_Capacity = capacity;this->m_Size = 0;this->pAddress = new int[this->m_Capacity];
}//拷貝構造
MyArray::MyArray(const MyArray & array)
{cout << "拷貝構造的調用" << endl;this->pAddress = new int[array.m_Capacity];this->m_Size = array.m_Size;this->m_Capacity = array.m_Capacity;for (int i = 0; i < array.m_Size; i++){this->pAddress[i] = array.pAddress[i];}}//析構
MyArray::~MyArray()
{if (this->pAddress != NULL){cout << "析構函數的調用" << endl;delete[]this->pAddress;this->pAddress = NULL;}
}void MyArray::Push_Back(int val)
{//判斷越界？用戶自己處理this->pAddress[this->m_Size] = val;this->m_Size++;
}int MyArray::getData(int index)
{return this->pAddress[index];
}void MyArray::setData(int index, int val)
{this->pAddress[index] = val;
}int MyArray::getCapacity()
{return this->m_Capacity;
}
int MyArray::getSize()
{return this->m_Size;
}

test.cpp

#include"Myarray.h"void test01()
{//堆區創建數組MyArray *array = new MyArray(30);MyArray *array2=new MyArray(*array);//new方式指定拷貝構造MyArray array3 = *array2;  //構造函數返回的本體//MyArray *array4 = array; //這聲明一個指針和array執行的地址相同，所以不會調用拷貝構造delete array;//尾插法的測試for (int i = 0; i < 10; i++){array2->Push_Back(i);}//獲取數據的測試for (int i = 0; i < 10; i++){cout << array2->getData(i) << endl;}//設置值的測試array2->setData(0, 1000);cout << array2->getData(0) << endl;//獲取數組大小cout << "array2的數組大小" << array2->getSize() << endl;//獲取數組容量cout << "array2的數組容量" << array2->getCapacity() << endl;}int main()
{test01();system("pause");return 0;
}