迟来的第九周实验报告（四）

#include <iostream>
using namespace std;
class Douary
{
public:
	Douary(int m, int n);//构造函数：用于建立动态数组存放m行n列的二维数组（矩阵）元素，并将该数组元素初始化为
	~Douary(); //析构函数：用于释放动态数组所占用的存储空间。
	Douary(const Douary &d);//构造函数：用于建立动态数组存放m行n列的二维数组（矩阵）元素，并将该数组元素初始化为 
	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   为二维数组的列数。
};
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;
}
Douary::Douary(int m,int n)
{
	row = m;
	col = n;
	Array = new int[m*n];
	int j;
	for(j=0;j<row*col;j++)
	{
                      Array[j]=0; 
		
	}
}
Douary::Douary(const Douary &d)  
{  
    row=d.row;  
    col=d.col;  
    Array = new int[row*col];                                              //开辟存储row*col个元素的空间  
    for(int i=0; i<row; ++i)  
        for(int j=0; j<col; ++j)  
            Array[i*col+j]=d.Array[i*col+j]; //注意地址求法   
}  


Douary::~Douary()
{
	delete [] Array; 
}
istream &operator>>(istream &input, Douary &d)
{
	int j;
	for(j=0;j<d.row*d.col;j++)
	{
		input >> d.Array[j];
	}
	return input;
}
ostream &operator<<(ostream &output, Douary &d)
{
	int i,j;
	for(i=0;i<d.row;i++)
	{
	for(j=0;j<d.col;j++)
	  {
		output << d.Array[j+i*d.col];
      }
	cout<<endl;
    }
	return output;
}
Douary operator+(const Douary &d1,const Douary &d2)
{
	Douary d(d1.row,d1.col);
	int j;
	for(j=0;j<d1.row*d1.col;j++)
	{
		d.Array [j] = d1.Array[j] + d2.Array[j];
	}
	return d;
}
Douary operator-(const Douary &d1,const Douary &d2)
{
	Douary d(d1.row,d1.col);
	int j;
	for(j=0;j<d1.row*d1.col;j++)
	{
		d.Array[j] = d1.Array[j] - d2.Array[j];
	}
	return d;
}
bool Douary::operator==(const Douary &d)                             //注意这里是普通的运算符重载并且不是友元函数
{
	int i;
	bool are = true;
	if(row!=d.row||col!=d.col) return false;
	for(i=0;i<row*col;++i)
	{
		if(d.Array[i]!=Array[i])
		{
		return are = false;
		break;
		}
		if (!are) break; 

	}
	return are;
	
}

 

 

 

这周的这个任务虽然有点复杂，但是最后发现只是知识掌握不够细腻。

开辟空间与撤销内存的new和delete的使用，以及构造函数的问题还有类的成员函数的定义与运算符重载。都是完成这个任务的关键。

PS：但是在我调了n遍后还不成功于是我怀疑它了。最后真的是它的事。。。。