//【任務4】建立一個二維數組類Douary,使該類中有以下數據成員、成員函數及友員函數,完成矩陣的輸入、輸出、加、減、相等判斷等操作。
#include <iostream>
using namespace std;
class Douary
{
public:
Douary(int m, int n);//構造函數:用於建立動態數組存放m行n列的二維數組(矩陣)元素,並將該數組元素初始化爲
~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(int m, int n) //構造函數:用於建立動態數組存放m行n列的二維數組(矩陣)元素,並將該數組元素初始化爲;
{
row = m;
col = n;
if(m != 0 && n!= 0)
{
Array = new int *[row];
for (int i = 0; i < row; i++)
{
Array[i] = new int[col];
}
}
else
Array = NULL;
}
Douary :: ~Douary()
{
if (Array != NULL)
{
for (int i = 0; i < row; i++)
{
delete Array[i];
}
delete[] Array;
Array = NULL;
}
}
istream &operator>>(istream &input, Douary &d)//重載運算符“>>”輸入二維數組,其中d爲Douary類對象;
{
//input >> d.row >> d.col;
if(d.row != 0 && d.col != 0)
{
int i,j;
d.Array = new int *[d.row];
for (i = 0; i < d.row; i++)
{
d.Array[i] = new int[d.col];
}
for (i = 0; i < d.row; ++i)
for(j = 0; j < d.col; ++j)
{
input >> d.Array[i][j];
}
}
else
d.Array = NULL;
return input;
}
ostream &operator<<(ostream &output, Douary &d)//重載運算符“<<”以m行n列矩陣的形式輸出二維數組,其中d爲Douary類對象。
{
output << d.row << '/' << d.col << endl;
if (d.row != 0 && d.col != 0)
{
int i,j;
for(i = 0; i < d.row; ++i)
{
for (j = 0; j < d.col; ++j)
output << d.Array[i][j] << " ";
output << endl;
}
}
return output;
}
Douary &operator +(const Douary &d1, const Douary &d2)//兩個矩陣相加,規則:對應位置上的元素相加
{
Douary *p = new Douary(0,0);
if (d1.row == d2.row && d1.col == d2.col)
{
int i, j;
p -> row = d2.row;
p -> col = d2.col;
p -> Array = new int *[d1.row];
for (i = 0; i < d1.row; i++)
{
p -> Array[i] = new int[d1.col];
}
for (i = 0; i < d2.row; ++i)
for(j = 0; j < d2.col; ++j)
{
p -> Array[i][j] = d1.Array[i][j] + d2.Array[i][j];
}
}
else
{
cout << "The dim of Matrix is not fixed!" << endl;
}
return *p;
}
Douary &operator-(const Douary &d1, const Douary &d2)//兩個矩陣相減,規則:對應位置上的元素相減
{
Douary *p = new Douary(0, 0);
if (d1.row == d2.row && d1.col == d2.col)
{
int i, j;
p -> row = d2.row;
p -> col = d2.col;
p -> Array = new int *[d1.row];
for (i = 0; i < d1.row; i++)
{
p -> Array[i] = new int[d1.col];
}
for (i = 0; i < d2.row; ++i)
for(j = 0; j < d2.col; ++j)
{
p -> Array[i][j] = d1.Array[i][j] - d2.Array[i][j];
}
}
else
{
cout << "The dim of Matrix is not fixed!" << endl;
}
return *p;
}
bool Douary::operator==(const Douary &d)//判斷兩個矩陣是否相等,即對應位置上的所有元素是否相等
{
bool b = false;
if (row == d.row && col == d.col)
{
int i,j;
for(i = 0; i < row;++i)
for(j = 0; j < col; ++j)
if(d.Array[i][j] != Array[i][j])
return false;
b = true;
}
return b;
}
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;
}
第九周作業4
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.