C++类模板 简易myArray

#pragma once
#include<iostream>
#include<string>
#include<memory>
#include<cstring>
using namespace std;
template<class T>
class myArray
{
private:
    T * pAddress;
    int m_Capacity;
    int m_Size;
public:
    myArray(int capacity=0, int size=0):m_Capacity(capacity), m_Size(size)
    {
        this->pAddress = new T[m_Capacity];
    }
    myArray(const myArray & oldArr)
    {
        this->m_Size = oldArr.m_Size;
        this->m_Capacity = oldArr.m_Capacity;
        this->pAddress = new T[m_Capacity];
        for (size_t i = 0; i < m_Capacity; i++)
        {
            this->pAddress[i] = oldArr.pAddress[i];
        }
    }
    myArray& operator=(const myArray& oldArr)
    {
        //先清空当前对象
        if (this->pAddress != nullptr)
        {
            delete[] pAddress;
            m_Capacity = 0;
            m_Size = 0;
        }
        //深拷贝
        this->m_Size = oldArr.m_Size;
        this->m_Capacity = oldArr.m_Capacity;
        this->pAddress = new T[m_Capacity];
        for (size_t i = 0; i < m_Capacity; i++)
        {
            this->pAddress[i] = oldArr.pAddress[i];
        }
        return *this;
    }
    T& operator [](int index)
    {  
        return pAddress[index];
    }
    // 尾删法
    bool myPop()
    {
        if (this->m_Size==0)
        {
            return false;
        }
        // delete this->pAddress+m_Size-1;
        // this->pAddress[m_Size-1] = nullptr;
        m_Size--;
        return true;
    }
    // 尾插法
    bool myPush(T& newItem)
    {
        if (this->m_Size==this->m_Capacity)
        {
            return false;
        }
        this->pAddress[m_Size] = newItem;
        m_Size++;
        return true;
    }
    ~myArray(){
        if (this->pAddress != nullptr)
        {
            delete[] this->pAddress;
            this->pAddress = nullptr;
            m_Capacity = 0;
            m_Size = 0;
        }    
    }
    int getCapacity()
    {
        return this->m_Capacity;
    }
    int getSize()
    {
        return this->m_Size;
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值