1．理解下面的動態(tài)數(shù)組類模板，它由一系列位置連續(xù)、任意數(shù)量相同類型的元素組成，其元素個數(shù)可在程序運行時改變，并完成該類中沒有完成的成員函數(shù)（不允許改變已有代碼），并設計主函數(shù)，實現(xiàn)對該模板類的功能測試。#include <iostream.h>#include <stdlib.h>//容錯處理enum ErrorType{invalidArraySize,memoryAllocatetionError,indexOutOfRang};char *errorMsg[] ={"Invalid array size","Memory allocation error","Invalid index"};template <class T>class Array{private:T* alist;int size;void Error(ErrorType error) const;//輸出錯誤信息public:Array(int sz=50);//構造函數(shù)Array(const Array<T>& X);//拷貝構造函數(shù)~Array(void);//析構函數(shù)Array<T>& operator=(const Array<T>& rhs);//重載賦值運算符T& operator[](int i);//重載下標運算符int GetSize(void) const;//獲取數(shù)組大小void Resize(int sz);//重新設置數(shù)組大小};template <class T>Array<T>::Array(int sz){if(sz <= 0)? Error(invalidArraySize);size = sz;alist = new T[size];if(alist == 0)? Error(memoryAllocatetionError);}template <class T>Array<T>::Array(const Array<T>& X){int n = X.size;size = n;alist = new T[n];if(alist == 0)? Error(memoryAllocatetionError);T* srcptr = X.alist;T* destptr = alist;while(n--)? *destptr++ = *srcptr++;}template<class T>Array<T>::~Array(){delete[] alist;}template <class T>Array<T>& Array<T>::operator=(const Array<T> &rhs){int n = rhs.size;if(size != n){? delete[] alist;? alist = new T[n];? if(alist == 0)?? Error(memoryAllocatetionError);? size = n;}T* destptr = alist;T* srcptr = rhs.alist;while(n--)? *destptr++ = *srcptr++;return *this;}template<class T>T& Array<T>::operator[](int n){if(n < 0 || n > size-1)? Error(indexOutOfRang);return alist[n];}void main(){}