题目如下:
来源: POJ (Coursera声明:在POJ上完成的习题将不会计入Coursera的最后成绩。)
注意: 总时间限制: 1000ms 内存限制: 65536kB
描述
写一个二维数组类 Array2,使得下面程序的输出结果是:
0,1,2,3,
4,5,6,7,
8,9,10,11,
next
0,1,2,3,
4,5,6,7,
8,9,10,11,
程序:
输入
无
输出
0,1,2,3,
4,5,6,7,
8,9,10,11,
next
0,1,2,3,
4,5,6,7,
8,9,10,11,
样例输入
样例输出
12345670,1,2,3,4,5,6,7,8,9,10,11,next0,1,2,3,4,5,6,7,8,9,10,11,
答案如下:
#include <iostream>
#include <cstring>
using namespace std;
// 在此处补充你的代码
class Array2
{
private:
int m;
int n;
int ** parr;
public:
Array2(const int m_= 0,const int n_= 0)
{
if ((m_ + n_))
{
m = m_;
n = n_;
parr = new int* [m];
for (int i = 0; i < m; i++)
{
parr[i] = new int[n ];
}
cout << "chushihua" <<m<<n<< endl;
}
else
{
parr = NULL;
}
}
int & operator()(int i, int j)
{
return parr[i][j];
}
int * & operator [](int i)
{
return parr[i];
}
Array2 & operator=(const Array2 & arr)
{
m = arr.m;
n = arr.n;
if (parr != NULL)
{
for (int i = 0; i < m; ++i)
{
delete[]parr[i];
//delete[]parr;
cout << "xigou" << parr << endl;
}
delete[]parr;
}
if (!arr.parr)
{
return *this;
}
parr = new int*[m ];
for (int i = 0; i < m; i++)
{
parr[i] = new int[n];
memcpy(parr[i], arr.parr[i], sizeof(int)*n);
}
for (int i = 0; i < m; ++i)
for(int j=0;j<n;j++)
{
parr[i][j] = arr.parr[i][j];
}
return *this;
}
~Array2()
{
if (parr)
{
for (int i = 0; i < m; ++i)
{
delete[]parr[i];
//delete[]parr;
cout << "xigou" <<parr<< endl;
}
delete[]parr;
}
}
};
int main() {
Array2 a(3, 4);
int i, j;
for (i = 0; i < 3; ++i)
for (j = 0; j < 4; j++)
a[i][j] = i * 4 + j;
for (i = 0; i < 3; ++i) {
for (j = 0; j < 4; j++) {
cout << a(i, j) << ",";
}
cout << endl;
}
cout << "next" << endl;
Array2 b;
cout << "hsajdgasjk" << endl;
b = a;
cout << "wsfas" << endl;
for (i = 0; i < 3; ++i) {
for (j = 0; j < 4; j++) {
cout << b[i][j] << ",";
}
cout << endl;
}
for (i = 0; i < 3; ++i) {
for (j = 0; j < 4; j++) {
cout << a(i, j) << ",";
}
cout << endl;
}
int t;
t = a(2, 2);
cout << t;
return 0;
}
注意点:
1.重载【】【】需要创建二维地址,delete时也需要两次;
2.重载=时,Array2 & operator=(const Array2 & arr)后面的&千万不能少,不然就会调用对象后提前析构
3.重载()int & operator()(int i, int j),前面的&不能省,不然没法做左值;