首页 > 其他分享 >35.数组下标重载

35.数组下标重载

时间：2022-10-13 20:58:29浏览次数：109  
标签：下标 int pArray pos MyArray mSize mCapacity 35 重载

程序1：

11数组下标重载.cpp

#pragma warning(disable:4996)
#include <iostream>
using namespace std;
#include "MyArray.h"

void test()
{
    MyArray arr;
    for( int i = 0; i < 20; i++ )
    {
        arr[i] = i + 10;
    }

    for( int i = 0; i < 20; i++ )
    {
        cout << arr[i] << " ";
    }
    cout << endl;
}

int main()
{
    test();

    system("pause");
    return EXIT_SUCCESS;
}

MyArray.cpp

#include "MyArray.h"

MyArray::MyArray()
{
    this->mCapacity = 20;
    this->mSize = 0;

    this->pArray = new int[this->mCapacity];
    for( int i = 0; i < this->mCapacity; i++ )
    {
        this->pArray[i] = 0;
    }
}

MyArray::~MyArray()
{
    if( this->pArray != NULL )
    {
        delete[] this->pArray;
        this->pArray = NULL;
    }
}

MyArray::MyArray(const MyArray &arr)
{
    this->mCapacity = arr.mCapacity;
    this->mSize = arr.mSize;
    //1.申请空间
    this->pArray = new int[arr.mCapacity];
    //2.拷贝数据
    for(int i = 0; i < this->mSize; i++)
    {
        this->pArray[i] = arr.pArray[i];
    }
}

MyArray::MyArray(int capacity, int val)
{
    this->mCapacity = capacity;
    this->mSize = capacity;
    this->pArray = new int[capacity];
    for(int i = 0; i < this->mSize; i++)
    {
        this->pArray[i] = val;
    }
}

//头插
void MyArray::PushFront(int val)
{
    //判断容量是否满
    if(this->mSize == this->mCapacity)
    {
        return;
    }

    for(int i = this->mSize - 1; i >= 0; i--)
    {
        this->pArray[i + 1] = this->pArray[i];
    }
    //空出了0的位置
    this->pArray[0] = val;

    //维护元素个数
    this->mSize++;
}

//尾插
void MyArray::PushBack(int val)
{
    //判断容量是否满
    if(this->mSize == this->mCapacity)
    {
        return;
    }

    this->pArray[this->mSize] = val;
    this->mSize++;
}

//头删
void MyArray::PopFront()
{
    //判断是否有元素
    if(this->mSize == 0)
    {
        return;
    }

    //后面的数往前面移动来覆盖第一个元素
    for(int i = 0; i < this->mSize - 1; i++)
    {
        this->pArray[i] = this->pArray[i + 1];
    }

    this->mSize--;
}

//尾删
void MyArray::PopBack()
{
    //判断是否有元素
    if(this->mSize == 0)
    {
        return;
    }
    this->mSize--;
}

//获取数组元素个数
int MyArray::Size()
{
    return this->mSize;
}

//获取数组容量
int MyArray::Capacity()
{
    return this->mCapacity;
}

//指定位置插入元素
void MyArray::Insert(int pos, int val)
{
    //判断容量是否满
    if(this->mSize == this->mCapacity)
    {
        return;
    }

    //如果位置不对就插到尾部
    if(pos < 0 || pos > this->mSize - 1)
    {
        pos = this->mSize;
    }

    for(int i = this->mSize - 1; i >= pos; i--)
    {
        this->pArray[i + 1] = this->pArray[i];
    }
    //pos是位置空出了
    this->pArray[pos] = val;

    this->mSize++;
}
//获取指定位置的值
int &MyArray::Get(int pos)
{
    return this->pArray[pos];
}

//在指定位置修改值
void MyArray::Set(int pos, int val)
{
    if(pos < 0 || pos > this->mCapacity - 1)
    {
        return;
    }

    this->pArray[pos] = val;
}

//重写赋值运算符重载函数
MyArray &MyArray::operator=(const MyArray &m)
{
    //1.释放原来的空间
    if( this->pArray != NULL )
    {
        delete[] this->pArray;
        this->pArray = NULL;
    }
    this->mCapacity = m.mCapacity;
    this->mSize = m.mSize;
    //2.申请空间，大小由m决定
    this->pArray = new int[m.mCapacity];
    //3.拷贝数据
    for( int i = 0; i < this->mSize; i++ )
    {
        this->pArray[i];
    }
    return *this;
}

//要能当左右值
int &MyArray::operator[](int index)
{
    return this->pArray[index];
}

MyArray.h

#pragma once
#include<iostream>
using namespace std;

class MyArray
{
public:
    MyArray();
    MyArray(const MyArray &arr);
    MyArray(int capicity, int val = 0);
    ~MyArray();

    //重写赋值运算符重载函数
    MyArray&operator=(const MyArray &m);

    //要能当左右值
    int &operator[](int index);

    //头插
    void PushFront(int val);
    //尾插
    void PushBack(int val);
    //头删
    void PopFront();
    //尾删
    void PopBack();
    //获取数组元素个数
    int Size();
    //获取数组容量
    int Capacity();
    //指定位置插入元素
    void Insert(int pos, int val);
    //获取指定位置的值
    int &Get(int pos);
    //在指定位置修改值
    void Set(int pos, int val);

private:
    int * pArray;//指向堆区空间，储存数据
    int mSize;//元素个数
    int mCapacity;//容量
};

输出结果：

10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
请按任意键继续. . .

程序2：

11数组下标重载.cpp

#pragma warning(disable:4996)
#include <iostream>
using namespace std;
#include "MyArray.h"

void test()
{
    MyArray arr;
    for( int i = 0; i < 20; i++ )
    {
        arr[i] = i + 10;
    }

    for( int i = 0; i < 20; i++ )
    {
        cout << arr[i] << " ";
    }
    cout << endl;
}

void test02()
{
    MyArray arr;
    for( int i = 0l; i < 20; i++ )
    {
        arr[i] = i + 10;
    }
    for( int i = 0; i < 20; i++ )
    {
        cout << arr[i] << " ";
    }
    cout << endl;
    
    MyArray arr2;
    arr2 = arr;
    for( int i = 0; i < 20; i++ )
    {
        cout << arr2[i] << " ";
    }
    cout << endl;
    cout << arr2.Size() << endl;
}

int main()
{
    test02();

    system("pause");
    return EXIT_SUCCESS;
}

MyArray.cpp

#include "MyArray.h"

MyArray::MyArray()
{
    this->mCapacity = 20;
    this->mSize = 0;

    this->pArray = new int[this->mCapacity];
    for( int i = 0; i < this->mCapacity; i++ )
    {
        this->pArray[i] = 0;
    }
}

MyArray::~MyArray()
{
    if( this->pArray != NULL )
    {
        delete[] this->pArray;
        this->pArray = NULL;
    }
}

MyArray::MyArray(const MyArray &arr)
{
    this->mCapacity = arr.mCapacity;
    this->mSize = arr.mSize;
    //1.申请空间
    this->pArray = new int[arr.mCapacity];
    //2.拷贝数据
    for(int i = 0; i < this->mSize; i++)
    {
        this->pArray[i] = arr.pArray[i];
    }
}

MyArray::MyArray(int capacity, int val)
{
    this->mCapacity = capacity;
    this->mSize = capacity;
    this->pArray = new int[capacity];
    for(int i = 0; i < this->mSize; i++)
    {
        this->pArray[i] = val;
    }
}

//头插
void MyArray::PushFront(int val)
{
    //判断容量是否满
    if(this->mSize == this->mCapacity)
    {
        return;
    }

    for(int i = this->mSize - 1; i >= 0; i--)
    {
        this->pArray[i + 1] = this->pArray[i];
    }
    //空出了0的位置
    this->pArray[0] = val;

    //维护元素个数
    this->mSize++;
}

//尾插
void MyArray::PushBack(int val)
{
    //判断容量是否满
    if(this->mSize == this->mCapacity)
    {
        return;
    }

    this->pArray[this->mSize] = val;
    this->mSize++;
}

//头删
void MyArray::PopFront()
{
    //判断是否有元素
    if(this->mSize == 0)
    {
        return;
    }

    //后面的数往前面移动来覆盖第一个元素
    for(int i = 0; i < this->mSize - 1; i++)
    {
        this->pArray[i] = this->pArray[i + 1];
    }

    this->mSize--;
}

//尾删
void MyArray::PopBack()
{
    //判断是否有元素
    if(this->mSize == 0)
    {
        return;
    }
    this->mSize--;
}

//获取数组元素个数
int MyArray::Size()
{
    return this->mSize;
}

//获取数组容量
int MyArray::Capacity()
{
    return this->mCapacity;
}

//指定位置插入元素
void MyArray::Insert(int pos, int val)
{
    //判断容量是否满
    if(this->mSize == this->mCapacity)
    {
        return;
    }

    //如果位置不对就插到尾部
    if(pos < 0 || pos > this->mSize - 1)
    {
        pos = this->mSize;
    }

    for(int i = this->mSize - 1; i >= pos; i--)
    {
        this->pArray[i + 1] = this->pArray[i];
    }
    //pos是位置空出了
    this->pArray[pos] = val;

    this->mSize++;
}
//获取指定位置的值
int &MyArray::Get(int pos)
{
    return this->pArray[pos];
}

//在指定位置修改值
void MyArray::Set(int pos, int val)
{
    if(pos < 0 || pos > this->mCapacity - 1)
    {
        return;
    }

    this->pArray[pos] = val;
}

//重写赋值运算符重载函数
MyArray &MyArray::operator=(const MyArray &m)
{
    cout << "赋值函数" << endl;
    //1.释放原来的空间
    if( this->pArray != NULL )
    {
        delete[] this->pArray;
        this->pArray = NULL;
    }
    this->mCapacity = m.mCapacity;
    this->mSize = m.mSize;
    //2.申请空间，大小由m决定
    this->pArray = new int[m.mCapacity];
    //3.拷贝数据
    for( int i = 0; i < this->mCapacity; i++ )
    {
        this->pArray[i] = m.pArray[i];
    }
    return *this;
}

//要能当左右值
int &MyArray::operator[](int index)
{
    //赋值时，加加
    if( this->mSize <= index )
    {
        this->mSize++;
    }

    return this->pArray[index];
}

MyArray.h

#pragma once
#include<iostream>
using namespace std;

class MyArray
{
public:
    MyArray();
    MyArray(const MyArray &arr);
    MyArray(int capicity, int val = 0);
    ~MyArray();

    //重写赋值运算符重载函数
    MyArray&operator=(const MyArray &m);

    //要能当左右值
    int &operator[](int index);

    //头插
    void PushFront(int val);
    //尾插
    void PushBack(int val);
    //头删
    void PopFront();
    //尾删
    void PopBack();
    //获取数组元素个数
    int Size();
    //获取数组容量
    int Capacity();
    //指定位置插入元素
    void Insert(int pos, int val);
    //获取指定位置的值
    int &Get(int pos);
    //在指定位置修改值
    void Set(int pos, int val);

private:
    int * pArray;//指向堆区空间，储存数据
    int mSize;//元素个数
    int mCapacity;//容量
};

输出结果：

10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
赋值函数
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
20
请按任意键继续. . .

标签：下标,int,pArray,pos,MyArray,mSize,mCapacity,35,重载
From： https://www.cnblogs.com/codemagiciant/p/16789605.html

相关文章

赞助商

阅读排行

网站主页关于我们联系我们网站地图

本网站内容转载自其他媒体，侵权联系[admin##ips99.com]。

Copyright © 2020-2023 IPS99 版权所有 IPS99