[cpp] view plain copy
- #include <iostream>
- using namespace std;
- class Douary
- {
- public:
- Douary(int m, int n);//構造函數:用于建立動态數組存放m行n列的二維數組(矩陣)元素,并将該數組元素初始化為
- Douary(const Douary &d);//構造函數:用于建立動态數組存放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;
- Array = new int[m*n];
- for(int i=0; i<row; ++i)
- for(int j=0; j<col; ++j)
- Array[i*col+j]=0;
- }
- Douary::Douary(const Douary &d)
- {
- row=d.row;
- col=d.col;
- Array = new int[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)//重載運算符“>>”輸入二維數組
- {
- for(int i=0; i<d.row; ++i)
- for(int j=0; j<d.col; ++j)
- cin>>d.Array[i*d.col+j];//注意位址求法
- return input;
- }
- ostream &operator<<(ostream &output, Douary &d)//重載運算符“<<”以m行n列矩陣的形式輸出二維數組
- {
- for(int i=0; i<d.row; ++i)
- {
- for(int j=0; j<d.col; ++j)
- cout<<d.Array[i*d.col+j]<<"\t";
- cout<<endl;
- }
- cout<<endl;
- return output;
- }
- Douary operator+(const Douary &d1,const Douary &d2)//兩個矩陣相加
- {
- Douary d(d1.row,d1.col);
- for(int i=0; i<d1.row; ++i)
- {
- for(int j=0; j<d1.col; ++j)
- d.Array[i*d1.col+j]=d1.Array[i*d1.col+j]+d2.Array[i*d1.col+j];
- }
- return d;
- }
- Douary operator-(const Douary &d1,const Douary &d2)//兩個矩陣相減
- {
- Douary d(d1.row,d1.col);
- for(int i=0; i<d1.row; ++i)
- {
- for(int j=0; j<d1.col; ++j)
- d.Array[i*d1.col+j]=d1.Array[i*d1.col+j]-d2.Array[i*d1.col+j];
- }
- return d;
- }
- bool Douary::operator ==(const Douary &d)//判斷兩個矩陣是否相等
- {
- if(row!=d.row||col!=d.col) return false;
- bool eq = true;
- for(int i=0; i<row; ++i)
- {
- for(int j=0; j<col; ++j)
- if (Array[i*col+j]!=d.Array[i*col+j])
- {
- eq=false;
- break;
- }
- if (!eq) break;
- }
- return eq;
- }
- int main()
- {
- Douary d1(2,3),d2(2,3);
- cout<<"輸入d1(2,3):"<<endl;
- cin>>d1;
- cout<<"輸入d2(2,3):"<<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;
- cout<<(d1-d2);
- cout<<"d1"<<((d1==d2)?"==":"!=")<<"d2"<<endl;
- system("pause");
- return 0;
- }