第⑨周实验报告④

来源:互联网 发布:阿里云 ecs 带宽 编辑:程序博客网 时间:2024/06/07 00:30

程序头部注释开始
* 程序的版权和版本声明部分
* Copyright (c) 2011, 烟台大学计算机学院学生
* All rights reserved.
* 文件名称:        用一维数组构造二维数组    
* 作    者:     王智凯                       
* 完成日期:  2012年    4  月   17  日
* 版 本 号:  凯子

 

 

#include <iostream>using namespace std;class Douary{public:Douary(int m, int n);//构造函数:用于建立动态数组存放m行n列的二维数组(矩阵)元素,并将该数组元素初始化为~Douary(); //析构函数:用于释放动态数组所占用的存储空间。  Douary(Douary &d); //此处增加一个复制构造函数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){row = m;col = n ;Array = new int[m*n];     for (int i = 0; i < m*n; i++)         Array[i] = 0;  }Douary::~Douary(){delete []Array;}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];    }istream &operator>>(istream &input, Douary &d)//重载运算符“>>”输入二维数组,其中d为Dousry类对象;{for(int i=0;i<d.row*d.col;i++)input >> d.Array[i];return input;}ostream &operator<<(ostream &output, Douary &d)//重载运算符“<<”以m行n列矩阵的形式输出二维数组,其中d为Douary类对象。{for(int i=0;i<d.row*d.col;i++){       if(i % d.row == 0) output << endl;   output << d.Array[i] << " ";}output << endl;return output;}Douary operator+(const Douary &d1,const Douary &d2)//两个矩阵相加,规则:对应位置上的元素相加{Douary d(d1.row,d1.col);for(int i = 0;i < d1.row * d1.col; i++){d.Array[i] = d1.Array[i] + d2.Array[i];}return d;}Douary operator-(const Douary &d1,const Douary &d2)//两个矩阵相减,规则:对应位置上的元素相减{Douary d(d1.row,d1.col);for(int i=0;i<d1.row*d1.col;i++){d.Array[i] = d1.Array[i] - d2.Array[i];}return d;}bool  Douary::operator==(const Douary &d)//判断两个矩阵是否相等,即对应位置上的所有元素是否相等{{if(row == d.row && col == d.col){    for(int i=0;i<row*col;i++)    {if(Array[i] != d.Array[i])return false;}}elsereturn false;}int main(){Douary d1(3,2),d2(3,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;cout<<(d1+d2);cout<<"d1-d2="<<endl;cout<<(d1-d2);cout<<"d1"<<((d1==d2)?"==":"!=")<<"d2"<<endl;system("pause");return 0;}


 

 

上机感言:通过这次做数组发现以前的知识忘记了好多,而且数组与指针的结合的题有些不敢下手,得回顾一下以前的知识了。。。

原创粉丝点击