第9周实验报告4

/* (程序头部注释开始)
* 程序的版权和版本声明部分
* Copyright (c) 2011, 烟台大学计算机学院学生
* All rights reserved.
* 文件名称：矩阵类
* 作    者：张旭
* 完成日期：  2012   年   4   月    16 日
* 版 本 号：略
* 对任务及求解方法的描述部分
* 输入描述：略
* 问题描述：略
* 程序输出：略
* 程序头部的注释结束
*/
#include <iostream>
using namespace std;

class Douary
{
public:
Douary(int m, int n):row(m), col(n){Array = new int [m * n];}//构造函数：用于建立动态数组存放m行n列的二维数组（矩阵）元素，并将该数组元素初始化为
~Douary(){delete []Array;} //析构函数：用于释放动态数组所占用的存储空间。
//此处增加一个复制构造函数
Douary (Douary &);
friend istream &operator>>(istream &input, Douary &d);//重载运算符“>>”输入二维数组，其中d为Dousry类对象；
friend ostream &operator<<(ostream &output, Douary &d);//重载运算符“<<”以m行n列矩阵的形式输出二维数组，其中d为Douary类对象。
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 为动态数组指针。
int row;          //row  为二维数组的行数。
int col;          //col   为二维数组的列数。
};

Douary::Douary(Douary &d)
{
row = d.row;
col = d.col;

Array = new int [row * col];

for (int i = 0; i < row * col; ++i)
{
*(Array + i) = *(d.Array + i);

}
}

bool Douary::operator ==(const Douary &d)
{
int point = 1;

for (int i = row * col - 1; i > 0; --i)
{
if (*(Array + i) != *(d.Array + i))
{
point = 0;

break;
}
}
return bool(point);
}

istream &operator>>(istream &input, Douary &d)
{
for (int i = 0; i < d.row; ++i)
{
cout << "请输入第" << i + 1 << "行的" << d.col << "个元素："<< endl;
for (int m = 0; m < d.col; ++m)
{
input >> *(d.Array + i + m);
}
}
return input;
}

ostream &operator<<(ostream &output, Douary &d)
{
for (int i = 0; i < d.row; ++i)
{
for (int m = 0; m < d.col; ++m)
{
output << *(d.Array + i + m);
}
cout << endl;
}
return output;
}

Douary operator + (const Douary &d1,const Douary &d2)
{
Douary temp(d1.row, d1.col);

for (int i = 0; i < d1.row * d1.col; ++i)
{
*(temp.Array + i) = *(d1.Array + i) + *(d2.Array + i);
}
return temp;
}

Douary operator - (const Douary &d1,const Douary &d2)
{
Douary temp(d1.row, d1.col);

for (int m = 0; m < d1.col * d1.row; ++m)
{
*(temp.Array + m) = *(d1.Array + m) - *(d2.Array + m);
}
return temp;
}

int main()
{
Douary d1(2,3),d2(2,3);
cout<<"输入d1:"<<endl;
cin>>d1;
cout<<"输入d2:"<<endl;
cin>>d2;
cout<<"d1="<<endl;
cout<<d1;
cout<<"d2="<<endl;
cout<<d2;
cout<<"d1+d2="<<endl;
cout<<(d1+d2);
cout<<"d1-d2="<<endl;
cout<<(d1-d2);
cout<<"d1"<<((d1==d2)?"==":"!=")<<"d2"<<endl;
system("pause");
return 0;
}