实验四-组合与继承
实验任务1源代码:
1 #pragma once 2 3 #include <vector> 4 #include <array> 5 #include <string> 6 7 class GradeCalc { 8 public: 9 GradeCalc(const std::string& cname); 10 void input(int n); // 录入n个成绩 11 void output() const; // 输出成绩 12 void sort(bool ascending = false); // 排序 (默认降序) 13 int min() const; // 返回最低分(如成绩未录入,返回-1) 14 int max() const; // 返回最高分 (如成绩未录入,返回-1) 15 double average() const; // 返回平均分 (如成绩未录入,返回0.0) 16 void info(); // 输出课程成绩信息 17 18 private: 19 void compute(); // 成绩统计 20 21 private: 22 std::string course_name; // 课程名 23 std::vector<int> grades; // 课程成绩 24 std::array<int, 5> counts; // 保存各分数段人数([0, 60), [60, 70), [70, 80), [80, 90), [90, 100] 25 std::array<double, 5> rates; // 保存各分数段人数占比 26 bool is_dirty; // 脏标记,记录是否成绩信息有变更 27 };
1 #include <algorithm> 2 #include <array> 3 #include <cstdlib> 4 #include <iomanip> 5 #include <iostream> 6 #include <numeric> 7 #include <string> 8 #include <vector> 9 10 #include "GradeCalc.hpp" 11 12 GradeCalc::GradeCalc(const std::string& cname) :course_name{ cname }, is_dirty{ true } { 13 counts.fill(0); 14 rates.fill(0); 15 } 16 17 void GradeCalc::input(int n) { 18 if (n < 0) { 19 std::cerr << "无效输入! 人数不能为负数\n"; 20 std::exit(1); 21 } 22 23 grades.reserve(n); 24 25 int grade; 26 27 for (int i = 0; i < n;) { 28 std::cin >> grade; 29 30 if (grade < 0 || grade > 100) { 31 std::cerr << "无效输入! 分数须在[0,100]\n"; 32 continue; 33 } 34 35 grades.push_back(grade); 36 ++i; 37 } 38 39 is_dirty = true; // 设置脏标记:成绩信息有变更 40 } 41 42 void GradeCalc::output() const { 43 for (auto grade : grades) 44 std::cout << grade << ' '; 45 std::cout << std::endl; 46 } 47 48 void GradeCalc::sort(bool ascending) { 49 if (ascending) 50 std::sort(grades.begin(), grades.end()); 51 else 52 std::sort(grades.begin(), grades.end(), std::greater<int>()); 53 } 54 55 int GradeCalc::min() const { 56 if (grades.empty()) 57 return -1; 58 59 auto it = std::min_element(grades.begin(), grades.end()); 60 return *it; 61 } 62 63 int GradeCalc::max() const { 64 if (grades.empty()) 65 return -1; 66 67 auto it = std::max_element(grades.begin(), grades.end()); 68 return *it; 69 } 70 71 double GradeCalc::average() const { 72 if (grades.empty()) 73 return 0.0; 74 75 double avg = std::accumulate(grades.begin(), grades.end(), 0.0) / grades.size(); 76 return avg; 77 } 78 79 void GradeCalc::info() { 80 if (is_dirty) 81 compute(); 82 83 std::cout << "课程名称:\t" << course_name << std::endl; 84 std::cout << "平均分:\t" << std::fixed << std::setprecision(2) << average() << std::endl; 85 std::cout << "最高分:\t" << max() << std::endl; 86 std::cout << "最低分:\t" << min() << std::endl; 87 88 const std::array<std::string, 5> grade_range{ "[0, 60) ", 89 "[60, 70)", 90 "[70, 80)", 91 "[80, 90)", 92 "[90, 100]" }; 93 94 for (int i = static_cast<int>(grade_range.size()) - 1; i >= 0; --i) 95 std::cout << grade_range[i] << "\t: " << counts[i] << "人\t" 96 << std::fixed << std::setprecision(2) << rates[i] * 100 << "%\n"; 97 } 98 99 void GradeCalc::compute() { 100 if (grades.empty()) 101 return; 102 103 counts.fill(0); 104 rates.fill(0.0); 105 106 // 统计各分数段人数 107 for (auto grade : grades) { 108 if (grade < 60) 109 ++counts[0]; // [0, 60) 110 else if (grade < 70) 111 ++counts[1]; // [60, 70) 112 else if (grade < 80) 113 ++counts[2]; // [70, 80) 114 else if (grade < 90) 115 ++counts[3]; // [80, 90) 116 else 117 ++counts[4]; // [90, 100] 118 } 119 120 // 统计各分数段比例 121 for (size_t i = 0; i < rates.size(); ++i) 122 rates[i] = counts[i] * 1.0 / grades.size(); 123 124 is_dirty = false; // 更新脏标记 125 }
1 #include <iostream> 2 #include <string> 3 #include "GradeCalc.hpp" 4 5 void test() { 6 GradeCalc c1("OOP"); 7 8 std::cout << "录入成绩:\n"; 9 c1.input(5); 10 11 std::cout << "输出成绩:\n"; 12 c1.output(); 13 14 std::cout << "排序后成绩:\n"; 15 c1.sort(); c1.output(); 16 17 std::cout << "*************成绩统计信息*************\n"; 18 c1.info(); 19 20 } 21 22 int main() { 23 test(); 24 }
实验任务1运行结果:

实验任务1问题1:
std::vector<int> grades; //课程成绩
std::array<int, 5> counts; //各分数段人数
std::array<double, 5> rates; //各分数段人数占比
实验任务1问题2:不合法,grades是私有成员,无法通过push_back这个vector类的成员函数进行访问
实验任务1问题3:
(1)1次。is_dirty用来记录是否更改原始数据,避免重复计算
(2)不需要更改。直接在update_grade函数内部重新设置is_dirty标记即可
实验任务1问题4:在info里加入
int size = grades.size();
if (size % 2 == 1)
{ return grades[size / 2]; }
else
{ return (grades[size / 2 - 1] + grades[size / 2]) / 2.0; }
实验任务1问题5:不能去掉,会保留之前数据导致数据错误。
实验任务1问题6:
(1)对程序功能没有影响
(2)对性能有影响,会导致数据量大时内存不够
实验任务2源代码:
1 #pragma once 2 3 #include <array> 4 #include <string> 5 #include <vector> 6 7 class GradeCalc : private std::vector<int> { 8 public: 9 GradeCalc(const std::string& cname); 10 void input(int n); // 录入n个成绩 11 void output() const; // 输出成绩 12 void sort(bool ascending = false); // 排序 (默认降序) 13 int min() const; // 返回最低分 14 int max() const; // 返回最高分 15 double average() const; // 返回平均分 16 void info(); // 输出成绩统计信息 17 18 private: 19 void compute(); // 计算成绩统计信息 20 21 private: 22 std::string course_name; // 课程名 23 std::array<int, 5> counts; // 保存各分数段人数([0, 60), [60, 70), [70, 80), [80, 90), [90, 100] 24 std::array<double, 5> rates; // 保存各分数段占比 25 bool is_dirty; // 脏标记,记录是否成绩信息有变更 26 };
1 #include <algorithm> 2 #include <array> 3 #include <cstdlib> 4 #include <iomanip> 5 #include <iostream> 6 #include <numeric> 7 #include <string> 8 #include <vector> 9 #include "GradeCalc.hpp" 10 11 12 GradeCalc::GradeCalc(const std::string& cname) : course_name{ cname }, is_dirty{ true } { 13 counts.fill(0); 14 rates.fill(0); 15 } 16 17 void GradeCalc::input(int n) { 18 if (n < 0) { 19 std::cerr << "无效输入! 人数不能为负数\n"; 20 return; 21 } 22 23 this->reserve(n); 24 25 int grade; 26 27 for (int i = 0; i < n;) { 28 std::cin >> grade; 29 if (grade < 0 || grade > 100) { 30 std::cerr << "无效输入! 分数须在[0,100]\n"; 31 continue; 32 } 33 34 this->push_back(grade); 35 ++i; 36 } 37 38 is_dirty = true; 39 } 40 41 void GradeCalc::output() const { 42 for (auto grade : *this) 43 std::cout << grade << ' '; 44 std::cout << std::endl; 45 } 46 47 void GradeCalc::sort(bool ascending) { 48 if (ascending) 49 std::sort(this->begin(), this->end()); 50 else 51 std::sort(this->begin(), this->end(), std::greater<int>()); 52 } 53 54 int GradeCalc::min() const { 55 if (this->empty()) 56 return -1; 57 58 return *std::min_element(this->begin(), this->end()); 59 } 60 61 int GradeCalc::max() const { 62 if (this->empty()) 63 return -1; 64 65 return *std::max_element(this->begin(), this->end()); 66 } 67 68 double GradeCalc::average() const { 69 if (this->empty()) 70 return 0.0; 71 72 double avg = std::accumulate(this->begin(), this->end(), 0.0) / this->size(); 73 return avg; 74 } 75 76 void GradeCalc::info() { 77 if (is_dirty) 78 compute(); 79 80 std::cout << "课程名称:\t" << course_name << std::endl; 81 std::cout << "平均分:\t" << std::fixed << std::setprecision(2) << average() << std::endl; 82 std::cout << "最高分:\t" << max() << std::endl; 83 std::cout << "最低分:\t" << min() << std::endl; 84 85 const std::array<std::string, 5> grade_range{ "[0, 60) ", 86 "[60, 70)", 87 "[70, 80)", 88 "[80, 90)", 89 "[90, 100]" }; 90 91 for (int i = static_cast<int>(grade_range.size()) - 1; i >= 0; --i) 92 std::cout << grade_range[i] << "\t: " << counts[i] << "人\t" 93 << std::fixed << std::setprecision(2) << rates[i] * 100 << "%\n"; 94 } 95 96 void GradeCalc::compute() { 97 if (this->empty()) 98 return; 99 100 counts.fill(0); 101 rates.fill(0); 102 103 // 统计各分数段人数 104 for (int grade : *this) { 105 if (grade < 60) 106 ++counts[0]; // [0, 60) 107 else if (grade < 70) 108 ++counts[1]; // [60, 70) 109 else if (grade < 80) 110 ++counts[2]; // [70, 80) 111 else if (grade < 90) 112 ++counts[3]; // [80, 90) 113 else 114 ++counts[4]; // [90, 100] 115 } 116 117 // 统计各分数段比例 118 for (size_t i = 0; i < rates.size(); ++i) 119 rates[i] = counts[i] * 1.0 / this->size(); 120 121 is_dirty = false; 122 }
1 #include <iostream> 2 #include <string> 3 #include "GradeCalc.hpp" 4 5 void test() { 6 GradeCalc c1("OOP"); 7 8 std::cout << "录入成绩:\n"; 9 c1.input(5); 10 11 std::cout << "输出成绩:\n"; 12 c1.output(); 13 14 std::cout << "排序后成绩:\n"; 15 c1.sort(); c1.output(); 16 17 std::cout << "*************成绩统计信息*************\n"; 18 c1.info(); 19 20 } 21 22 int main() { 23 test(); 24 }
实验任务2运行结果:

实验任务2问题1:class GradeCalc : private std::vector<int>
实验任务2问题2:基类接口不会成为继承类接口。不能编译,push_back是公有接口,只能在继承类内部使用
实验任务2问题3:组合方式通过公有接口访问,继承方式通过私有继承,不能在外部调用公有接口
实验任务2问题4:组合方式,更加灵活,维护时只需要修改GradeCalc类
实验任务3源代码:
1 #pragma once 2 3 #include <string> 4 #include <vector> 5 6 enum class GraphType { circle, triangle, rectangle }; 7 8 // Graph类定义 9 class Graph { 10 public: 11 virtual void draw() {} 12 virtual ~Graph() = default; 13 }; 14 15 // Circle类声明 16 class Circle : public Graph { 17 public: 18 void draw(); 19 }; 20 21 // Triangle类声明 22 class Triangle : public Graph { 23 public: 24 void draw(); 25 }; 26 27 // Rectangle类声明 28 class Rectangle : public Graph { 29 public: 30 void draw(); 31 }; 32 33 // Canvas类声明 34 class Canvas { 35 public: 36 void add(const std::string& type); // 根据字符串添加图形 37 void paint() const; // 使用统一接口绘制所有图形 38 ~Canvas(); // 手动释放资源 39 40 private: 41 std::vector<Graph*> graphs; 42 }; 43 44 // 4. 工具函数 45 GraphType str_to_GraphType(const std::string& s); // 字符串转枚举类型 46 Graph* make_graph(const std::string& type); // 创建图形,返回堆对象指针
1 #include <algorithm> 2 #include <cctype> 3 #include <iostream> 4 #include <string> 5 6 #include "Graph.hpp" 7 8 // Circle类实现 9 void Circle::draw() { std::cout << "draw a circle...\n"; } 10 11 // Triangle类实现 12 void Triangle::draw() { std::cout << "draw a triangle...\n"; } 13 14 // Rectangle类实现 15 void Rectangle::draw() { std::cout << "draw a rectangle...\n"; } 16 17 // Canvas类实现 18 void Canvas::add(const std::string& type) { 19 Graph* g = make_graph(type); 20 if (g) 21 graphs.push_back(g); 22 } 23 24 void Canvas::paint() const { 25 for (Graph* g : graphs) 26 g->draw(); 27 } 28 29 Canvas::~Canvas() { 30 for (Graph* g : graphs) 31 delete g; 32 } 33 34 // 工具函数实现 35 // 字符串 → 枚举转换 36 GraphType str_to_GraphType(const std::string& s) { 37 std::string t = s; 38 std::transform(s.begin(), s.end(), t.begin(), 39 [](unsigned char c) { return std::tolower(c); }); 40 41 if (t == "circle") 42 return GraphType::circle; 43 44 if (t == "triangle") 45 return GraphType::triangle; 46 47 if (t == "rectangle") 48 return GraphType::rectangle; 49 50 return GraphType::circle; // 缺省返回 51 } 52 53 // 创建图形,返回堆对象指针 54 Graph* make_graph(const std::string& type) { 55 switch (str_to_GraphType(type)) { 56 case GraphType::circle: return new Circle; 57 case GraphType::triangle: return new Triangle; 58 case GraphType::rectangle: return new Rectangle; 59 default: return nullptr; 60 } 61 }
1 #include <string> 2 #include "Graph.hpp" 3 4 void test() { 5 Canvas canvas; 6 7 canvas.add("circle"); 8 canvas.add("triangle"); 9 canvas.add("rectangle"); 10 canvas.paint(); 11 } 12 13 int main() { 14 test(); 15 }
实验任务3运行结果:

实验任务3问题1:
(1)std::vector<Graph*> graphs; //添加图形对象
(2)class Cirlce: public Graph
class Triangle: public Graph
class Rectangle: public Graph
实验任务3问题2:
(1)会导致无法指向对应的对象,无法输出有效对象
(2)定义对象是都会被存为Graph对象导致结果无法输出
(3)会导致派生类的析构函数无法被调用
实验任务3问题3:Graph.hpp中,在enum class GraphType中加入star。Graph.cpp中,加入
class Star : public Graph {
public:
void draw();
};
在make_graph中switch里,增加case分支为case GraphType::star: return new Star;
实验任务3问题4:
(1)在Canvas类的析构函数中被释放
(2)易于理解、灵活控制,但可能造成悬空指针和内存泄漏
实验任务4场景描述:市场上有一些小型的毛绒玩具挂件,有不同的动物造型,按压还会发出声音。
对象关系:玩具类Toy,其他的动物玩具挂件继承自public Toy,通过虚函数voice实现各自的叫声
实验任务4源代码:
1 #pragma once 2 3 #include <string> 4 #include <vector> 5 6 enum class ToyType { cat, dog, cow, sheep }; 7 8 //Toy类定义 9 class Toy { 10 public: 11 virtual void voice() {}; 12 virtual ~Toy() = default; 13 }; 14 15 class Cat : public Toy { 16 public: 17 void voice(); 18 }; 19 20 class Dog : public Toy { 21 public: 22 void voice(); 23 }; 24 25 class Cow : public Toy { 26 public: 27 void voice(); 28 }; 29 30 class Sheep : public Toy { 31 public: 32 void voice(); 33 }; 34 35 class TheToys { 36 public: 37 void add(const std::string& ToyType); 38 void use() const; 39 ~TheToys(); 40 41 private: 42 std::vector<Toy*> toys; 43 }; 44 45 ToyType str_to_ToyType(const std::string& s); 46 Toy* make_toy(const std::string& toytype);
1 #include <algorithm> 2 #include <cctype> 3 #include <iostream> 4 #include <string> 5 6 #include "Toy.hpp" 7 8 void Cat::voice() { std::cout << "I'm a cat, meow meow ..." << std::endl; } 9 10 void Dog::voice() { std::cout << "I'm a dog, woof woof ..." << std::endl; } 11 12 void Cow::voice() { std::cout << "I'm a cow, moon moon ..." << std::endl; } 13 14 void Sheep::voice() { std::cout << "I'm a sheep,me me ..." << std::endl;; } 15 16 void TheToys::add(const std::string& toytype) { 17 Toy* t = make_toy(toytype); 18 if (t) 19 toys.push_back(t); 20 } 21 22 void TheToys::use() const { 23 for (Toy* t : toys) 24 t->voice(); 25 } 26 27 TheToys::~TheToys() { 28 for (Toy* t : toys) 29 delete t; 30 } 31 32 ToyType str_to_ToyType(const std::string& s) { 33 std::string t = s; 34 std::transform(s.begin(), s.end(), t.begin(), 35 [](unsigned char c) { return std::tolower(c); }); 36 37 if (t == "cat") 38 return ToyType::cat; 39 40 if (t == "dog") 41 return ToyType::dog; 42 43 if (t == "cow") 44 return ToyType::cow; 45 46 if (t == "sheep") 47 return ToyType::sheep; 48 49 return ToyType::cat; // 缺省返回 50 } 51 52 Toy* make_toy(const std::string& type) { 53 switch (str_to_ToyType(type)) { 54 case ToyType::cat: return new Cat; 55 case ToyType::dog: return new Dog; 56 case ToyType::cow: return new Cow; 57 case ToyType::sheep: return new Sheep; 58 default: return nullptr; 59 } 60 }
1 #include <string> 2 #include "Toy.hpp" 3 4 void test() { 5 TheToys mytoy; 6 7 mytoy.add("cat"); 8 mytoy.add("dog"); 9 mytoy.add("cow"); 10 mytoy.add("sheep"); 11 mytoy.use(); 12 } 13 14 int main() { 15 test(); 16 }
实验任务4运行结果:

浙公网安备 33010602011771号