75.数组封装用{}初始化,以及{}嵌套初始化

一维数组封装

• myArray.h

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

class myArray
{
public:
    int *p;//地址
    int n;//长度
public:
    //根据{}初始化
    myArray(initializer_list<int> list);
    ~myArray();
    //显示数据
    void show();
    //从大到小排序
    void sort();
    void operator +(myArray &my);
};

• myArray.cpp

  #include "myArray.h"
  
  myArray::myArray(initializer_list<int> list)
  {
      this->n = list.size();//开辟内存
      this->p = new int[this->n];
      int id = 0;
      for (auto i : list)
      {
          this->p[id++] = i;
      }
  }
  
  
  myArray::~myArray()
  {
  }
  
  void myArray::show()
  {
      for (int i = 0; i < this->n; i++)
      {
          cout << p[i] << endl;
      }
  }
  
  void myArray::sort()
  {
      for (int i = 0; i < this->n-1; i++)
      {
          for (int j = 0; j < this->n - 1 - i; j++)
          {
              if (p[j] < p[j + 1])
              {
                  int temp = p[j];
                  p[j] = p[j + 1];
                  p[j + 1] = temp;
              }
          }
      }
  }
  
  void myArray::operator+(myArray &my)
  {
      for (int i = 0; i < this->n; i++)
      {
          this->p[i] += my.p[i];
      }
  }

• erweiArray.h

  #pragma once
  #include <iostream>
  #include <initializer_list>
  using namespace std;
  
  class erweiArray
  {
  public:
      int **pp;//地址
      int *p;
      int n;//长度
  public:
      erweiArray();
      ~erweiArray();
      //根据{}初始化
      erweiArray(initializer_list<initializer_list<int>> list);
      //显示数据
      void show();
  };

• erweiArray.cpp

  #include "erweiArray.h"
  
  
  
  erweiArray::erweiArray()
  {
  }
  
  
  erweiArray::~erweiArray()
  {
      //析构函数
      for (int i = 0; i < this->n; i++)
      {
          delete[] this->pp[i];
      }
      delete this->pp;
      delete this->p;
  }
  
  erweiArray::erweiArray(initializer_list<initializer_list<int>> list)
  {
      //开辟指针数组
      this->n = list.size();
      this->p = new int[this->n];//记录每行几个
      this->pp = new int*[this->n];//记录一共有多少行
  
      //下标
      int id0 = 0;
      //循环赋值 
      for (auto i : list)
      {
          this->pp[id0] = new int[i.size()];//再次分配
          p[id0] = i.size();
          int id1 = 0;
          for (auto j : i)
          {
              pp[id0][id1] = j;
              id1++;
          }
          id0++;
      }
  }
  
  void erweiArray::show()
  {
      for (int i = 0; i < this->n; i++)
      {
          for (int j = 0; j < this->p[i]; j++)
          {
              cout << this->pp[i][j];
          }
          cout << endl;
      }
  }

• 测试函数

  #include <iostream>
  #include "myArray.h"
  #include "erweiArray.h"
  using namespace std;
  
  void main()
  {
      /*myArray *p = new myArray{ 1,2,3,4,5 };*/
      /*p->sort();
      p->show();*/
      /*myArray my{ 1,1,1,1,1 };
      my + (*p);
      my.show();*/
  
      erweiArray my1{ {1,2,3},{4,5,6},{7,8,9} };
      my1.show();
      cin.get();
  }