二维数组类Douary

只想说,其实还是一维动态数组。。。。

#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
class Douary
{
public:
	Douary(int m, int n);//构造函数:用于建立动态数组存放m行n列的二维数组(矩阵)元素,并将该数组元素初始化为0
	Douary(const Douary &d);  //因为有指针数据成员,复制构造函数需要定义
	~Douary(); //析构函数:用于释放动态数组所占用的存储空间。
	friend istream &operator>>(istream &input, Douary &d);//重载运算符“>>”输入二维数组
	friend ostream &operator<<(ostream &output, Douary &d);//重载运算符“<<”以m行n列形式输出
	friend Douary operator+(const Douary &d1,const Douary &d2);//两个矩阵相加,规则:对应位置上的元素相加
	friend Douary operator-(const Douary &d1,const Douary &d2);//两个矩阵相减,规则:对应位置上的元素相减
	bool operator==(const Douary &d);//判断两个矩阵是否相等,即对应位置上的所有元素是否相等
private:
	int *Array;      //Array 为动态数组指针,构造函数中分配空间用Array = new int[row*col];
	int row;          //row  为二维数组的行数。
	int col;          //col   为二维数组的列数。
};
Douary::Douary(int m, int n):row(m),col(n)
{Array=new int[row*col];}
Douary::Douary(const Douary &d)
{
  row=d.row;
  col=d.col;
  Array=new int[row*col];
  for(int i=0;i<d.row;i++)
    for(int j=0;j<d.col;j++)
      Array[i*row+j]=d.Array[i*row+j];
}
Douary::~Douary(){delete[]Array;}
istream &operator>>(istream &input, Douary &d)
{
  for(int i=0;i<d.row;i++)
    for(int j=0;j<d.col;j++)
      input>>d.Array[i*d.row+j];
  return input;
}
ostream &operator<<(ostream &output, Douary &d)
{
  for(int i=0;i<d.row;i++)
    for(int j=0;j<d.col;j++)
      {
        output<<d.Array[i*d.row+j]<<" ";
        if(j==d.col-1)output<<endl;
      }
  return output;
}
Douary operator+(const Douary &d1,const Douary &d2)
{
  Douary aa(d1);
  if(d1.row!=d2.row||d1.col!=d2.col)cout<<"尼玛这能加吗?"<<endl;
  else
    for(int i=0;i<d1.row;i++)
      for(int j=0;j<d1.col;j++)
        aa.Array[i*d1.row+j]=d1.Array[i*d1.row+j]+d2.Array[i*d2.row+j];
  return aa;
}
Douary operator-(const Douary &d1,const Douary &d2)
{
  Douary aa(d1);
  if(d1.row!=d2.row||d1.col!=d2.col)cout<<"尼玛这能加吗?"<<endl;
  else
    for(int i=0;i<d1.row;i++)
      for(int j=0;j<d1.col;j++)
        aa.Array[i*d1.row+j]=d1.Array[i*d1.row+j]-d2.Array[i*d2.row+j];
  return aa;
}
bool Douary::operator==(const Douary &d)
{
  for(int i=0;i<d.row;i++)
    for(int j=0;j<d.col;j++)
     {
       if(Array[i*d.row+j]!=d.Array[i*d.row+j])
       return false;
     }
  return true;
}
int main()
{
    Douary d1(2,2),d2(2,2);
    cout<<"输入d1:"<<endl;
    cin>>d1;
    cout<<"输入d2:"<<endl;
    cin>>d2;
    cout<<"d1="<<endl;
    cout<<d1;
    cout<<"d2="<<endl;
    cout<<d2;
    cout<<"d1+d2="<<endl;
    Douary d3=d1+d2;
    cout<<d3;
    cout<<"d1-d2="<<endl;
    Douary d4=d1-d2;
    cout<<d4;
    cout<<"d1"<<((d1==d2)?"==":"!=")<<"d2"<<endl;
    return 0;
}


  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 3
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值