作业2024/2/5

第四章 堆与拷贝构造函数

一 、程序阅读题

1、给出下面程序输出结果。

#include <iostream.h>

class example

{int a;

public:

example(int b=5){a=b++;}

void print(){a=a+1;cout <<a<<"";}

void print()const

{cout<<a<<endl;}

};

void main()

{example x;

const example y(2);

x.print();

y.print();

}

6 2

2、运行程序,写出程序执行的结果。

#include<iostream.h>

class Location

{ public:

int X,Y;

void init(int initX,int initY);

int GetX();

int GetY();

};

void Location::init (int initX,int initY)

{X=initX;

Y=initY;

}

int Location::GetX()

{return X;

}

int Location::GetY()

{return Y;

}

void display(Location& rL)

{cout<<rL.GetX()<<" "<<rL.GetY()<<\n;

}

void main()

{

Location A[5]={{5,5},{3,3},{1,1},{2,2},{4,4}};

Location *rA=A;

A[3].init(7,3);

rA->init(7,8);

for (int i=0;i<5;i++)

display(*(rA++));

}

7 8

3 3

1 1

7 3

4 4

3. 给出下面程序输出结果。

#include <iostream.h>

int a[8]={1,2,3,4,5,6,7};

void fun(int *pa,int n);

void main()

{int m=8;

fun(a,m);

cout<<a[7]<<endl;

}

void fun(int *pa,int n)

{for (int i=0;i<n-1;i++)

*(pa+7)+=*(pa+i);

}

28

4. 给出下面程序输出结果。

#include <iostream.h>

class A

{

int *a;

public:

A(int x=0):a(new int(x)){}

~A() {delete a;}

int getA() {return *a;}

void setA(int x) {*a=x;}

};

void main()

{

A x1,x2(3);

A *p=&x2;

(*p).setA(x2.getA()+5);

x1.setA(10+x1.getA());

cout<<x1.getA()<<""<<x2.getA()<<endl;

}

10 8

  1. 阅读下面的程序,写出运行结果:

|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| #include < iostream> using namespace std; class Samp { public: void Set_i_j(int a, int b){i=a,j=b;} ~Samp() { cout <<"Destroying.." << i <<endl; } int GetMulti () { return i * j; } protected: int i; int j; }; int main () { Samp * p; p = new Sampl0; if(!p) { cout << "Allocation error \ n"; return; } for(int j =0; j<l0; j ++) pj. Set_i_j (j, j); for(int k=0; k<l0; k++) cout <<"Multi" \<\ is:"<< pk.GetMulti () <<endl; delete p; return 0; } Multi0 is: 0 Multi1 is: 1 Multi2 is: 4 Multi3 is: 9 Multi4 is: 16 Multi5 is: 25 Multi6 is: 36 Multi7 is: 49 Multi8 is: 64 Multi9 is: 81 Destroying..0 Destroying..1 Destroying..2 Destroying..3 Destroying..4 Destroying..5 Destroying..6 Destroying..7 Destroying..8 Destroying..9 |

  1. 写出下面程序的运行结果,请用增加拷贝构造函数的方法避免存在的问题。

|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| #include < iostream> using namespace std; class Vector { public: Vector (int s = 100); int& Elem(int ndx); void Display(); void Set (); ~Vector (); protected: int size; int* buffer; } Vector::Vector (int s) { buffer = new int size = s; for(int i = O; i<size; i + + ) buffer i = i* i; } int& Vector:: Elem(int ndx) { if(ndx< 0 || ndx> = size) { cout << "error in index" <<endl; exit (1); } return buffer ndx; } void Vector::Display () { for(int j =0; j< size; j ++) cout << bufferj <<endl; } void Vector:: Set () { for(int j =0; j<size; j++) bufferj = j + 1; } Vector:: ~ Vector() { delete \[\] buffer; } int main() { Vector a(10); Vector b(a); a. Set (); b. Display (); return 0; } 加的构造函数 #include <iostream> using namespace std; class Vector { public: Vector(int s = 100); Vector(const Vector& other); // 拷贝构造函数 int& Elem(int ndx); void Display(); void Set(); ~Vector(); protected: int size; int* buffer; }; Vector::Vector(int s) { buffer = new intsize = s; for (int i = 0; i < size; i++) bufferi = i * i; } Vector::Vector(const Vector& other) { size = other.size; buffer = new intsize; for (int i = 0; i < size; i++) bufferi = other.bufferi; } int& Vector::Elem(int ndx) { if (ndx < 0 || ndx >= size) { cout << "error in index" << endl; exit(1); } return bufferndx; } void Vector::Display() { for (int j = 0; j < size; j++) cout << bufferj << endl; } void Vector::Set() { for (int j = 0; j < size; j++) bufferj = j + 1; } Vector::~Vector() { delete\[\] buffer; } int main() { Vector a(10); Vector b(a); a.Set(); b.Display(); return 0; } |

7.读下面的程序与运行结果,添上一个拷贝构造函数来完善整个程序。

|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| #include < iostream> using namespace std; class CAT { public: CAT(); CAT(const CAT&); ~CAT(); int GetAge() const (return * itsAge;) void SetAge(int age) { * itsAge = age; } protected: int * itsAge; }; CAT::CAT () { itsAge = new int; *itsAge = 5; } CAT::~CAT () { delete itsAge; itsAge = 0; } void main() { CAT frisky; cout << "frisky's age:" << frisky. GetAge() <<endl; cout <<"Setting frisky to 6... \ n"; frisky. SetAge ( 6 ); cout << "Creating boots from frisky \ n"; CAT boots(frisky); cout <<"frisky's age:" << frisky. GetAge() <<endl; cout << "boots'age:" << boons. GetAge () <<endl; cout << "setting frisk,, to 7 .... n"; frisky. SetAge (7); cout <<"frisky"s age:" << frisky. GetAge() <<endl; cout <<"boots' age:" << boots. GetAge() <<endl; } |

运行结果为:

frisky's age:5

Setting frisky to 6...

Creating boots from frisky

frisky's age:6

boots' age:6

Setting frisky to 7...

frisky's age:7

boots' age:6

添加

CAT::CAT(const CAT& other) {

itsAge = new int;

*itsAge = *other.itsAge;

}

CAT::~CAT() {

delete itsAge;

itsAge = 0;

}

相关推荐
JieE2129 小时前
LeetCode 101. 对称二叉树|JS 递归 + 迭代双解法,彻底搞懂镜像判断
javascript·算法
JieE2121 天前
LeetCode 56. 合并区间|超清晰 JS 图解思路,面试高频区间题
javascript·算法·面试
Jack202 天前
HarmonyOS开发中错误处理策略:网络异常统一处理
算法
小小杨树2 天前
读懂色彩:拍照调色不再难
算法·计算机视觉·配色
JieE2122 天前
LeetCode 226. 翻转二叉树|JS 递归超详细拆解,二叉树入门经典题
javascript·算法
JieE2122 天前
LeetCode 104. 二叉树的最大深度|递归思路超详细拆解
javascript·算法
vivo互联网技术3 天前
CVPR 2026 | 全新强化学习框架 BeautyGRPO:重塑真实人像
算法·大模型·cvpr·影像
Darling噜啦啦3 天前
列表转树算法深度解析:从 Map 到 Reduce 的两种实现,面试高频考点
数据结构·算法·面试
clint4563 天前
C++进阶(1)——前景提要
c++