OOP实验一
##任务一
代码:
1 // 现代C++标准库、算法库体验 2 // 本例用到以下内容: 3 // 1. 字符串string, 动态数组容器类vector、迭代器 4 // 2. 算法库:反转元素次序、旋转元素 5 // 3. 函数模板、const引用作为形参 6 7 #include <iostream> 8 #include <string> 9 #include <vector> 10 #include <algorithm> 11 12 using namespace std; 13 14 // 声明 15 // 模板函数声明 16 template<typename T> 17 void output(const T &c); 18 19 // 普通函数声明 20 void test1(); 21 void test2(); 22 void test3(); 23 24 int main() { 25 cout << "测试1: \n"; 26 test1(); 27 28 cout << "\n测试2: \n"; 29 test2(); 30 31 cout << "\n测试3: \n"; 32 test3(); 33 } 34 35 // 函数实现 36 // 输出容器对象c中的元素 37 template <typename T> 38 void output(const T &c) { 39 for(auto &i: c) 40 cout << i << " "; 41 cout << endl; 42 } 43 44 // 测试1 45 // 组合使用算法库、迭代器、string反转字符串 46 void test1() { 47 string s0{"0123456789"}; 48 cout << "s0 = " << s0 << endl; 49 50 string s1{s0}; 51 reverse(s1.begin(), s1.end()); // 反转指定迭代器区间的元素 52 cout << "s1 = " << s1 << endl; 53 54 string s2{s0}; 55 reverse_copy(s0.begin(), s0.end(), s2.begin()); // 将指定迭代区间的元素拷贝到指定迭代器开始的目标区间,并且在复制过程中反转次序 56 cout << "s2 = " << s2 << endl; 57 } 58 59 // 测试2 60 // 组合使用算法库、迭代器、vector反转动态数组对象vector内数据 61 void test2() { 62 vector<int> v0{2, 0, 4, 9}; 63 cout << "v0: "; 64 output(v0); 65 66 vector<int> v1{v0}; 67 reverse(v1.begin(), v1.end()); 68 cout << "v1: "; 69 output(v1); 70 71 72 vector<int> v2{v0}; 73 reverse_copy(v0.begin(), v0.end(), v2.begin()); 74 cout << "v2: "; 75 output(v2); 76 } 77 78 // 测试3 79 // 组合使用算法库、迭代器、vector实现元素旋转移位 80 void test3() { 81 vector<int> v0{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; 82 cout << "v0: "; 83 output(v0); 84 85 vector<int> v1{v0}; 86 rotate(v1.begin(), v1.begin()+1, v1.end()); // 旋转指定迭代器区间[v1.begin(), v1.end())之间的数据项,旋转后从迭代器v1.begin()+1位置的数据项开始 87 cout << "v1: "; 88 output(v1); 89 90 vector<int> v2{v0}; 91 rotate(v2.begin(), v2.begin()+2, v2.end()); 92 cout << "v2: "; 93 output(v2); 94 95 vector<int> v3{v0}; 96 rotate(v3.begin(), v3.end()-1, v3.end()); 97 cout << "v3: "; 98 output(v3); 99 100 vector<int> v4{v0}; 101 rotate(v4.begin(), v4.end()-2, v4.end()); 102 cout << "v4: "; 103 output(v4); 104 }
运行结果:
##任务二
代码:
1 #include <iostream> 2 #include <vector> 3 #include <string> 4 #include <algorithm> 5 #include <numeric> 6 #include <iomanip> 7 8 using namespace std; 9 10 // 函数声明 11 // 模板函数声明 12 template<typename T> 13 void output(const T &c); 14 15 // 普通函数声明 16 int rand_int_100(); 17 void test1(); 18 void test2(); 19 20 int main() { 21 cout << "测试1: \n"; 22 test1(); 23 24 cout << "\n测试2: \n"; 25 test2(); 26 } 27 28 // 函数实现 29 // 输出容器对象c中的元素 30 template <typename T> 31 void output(const T &c) { 32 for(auto &i: c) 33 cout << i << " "; 34 cout << endl; 35 } 36 37 // 返回[0, 100]区间内的一个随机整数 38 int rand_int_100() { 39 return rand() % 101; 40 } 41 42 // 测试1 43 // 对容器类对象指定迭代器区间进行赋值、排序 44 void test1() { 45 vector<int> v0(10); // 创建一个动态数组对象v0, 对象大小为10 46 generate(v0.begin(), v0.end(), rand_int_100); // 产生[0, 100]之间的随机整数赋值给指定迭代器区间[v0.begin(), v0.end())内的每个数据项 47 cout << "v0: "; 48 output(v0); 49 50 vector<int> v1{v0}; 51 sort(v1.begin(), v1.end()); // 对指定迭代器区间[v1.begin(), v1.end())内数据项进行升序排序 52 cout << "v1: "; 53 output(v1); 54 55 vector<int> v2{v0}; 56 sort(v2.begin()+1, v2.end()-1); // 对指定迭代器区间[v1.begin()+1, v1.end()-1)内数据项进行升序排序 57 cout << "v2: "; 58 output(v2); 59 } 60 61 // 测试2 62 // 对容器类对象指定迭代器区间进行赋值、计算最大值/最小值/均值 63 void test2() { 64 vector<int> v0(10); 65 generate(v0.begin(), v0.end(), rand_int_100); 66 cout << "v0: "; 67 output(v0); 68 69 auto iter1 = min_element(v0.begin(), v0.end()); 70 cout << "最小值: " << *iter1 << endl; 71 72 auto iter2 = max_element(v0.begin(), v0.end()); 73 cout << "最大值: " << *iter2 << endl; 74 75 auto ans = minmax_element(v0.begin(), v0.end()); 76 cout << "最小值: " << *(ans.first) << endl; 77 cout << "最大值: " << *(ans.second) << endl; 78 double avg1 = accumulate(v0.begin(), v0.end(), 0)/v0.size(); 79 cout << "均值: " << fixed << setprecision(2) << avg1 << endl; 80 81 cout << endl; 82 83 vector<int> v1{v0}; 84 cout << "v0: "; 85 output(v0); 86 sort(v1.begin(), v1.end()); 87 double avg2 = accumulate(v1.begin()+1, v1.end()-1, 0)/(v1.size()-2); 88 cout << "去掉最大值、最小值之后,均值: " << avg2 << endl; 89 }
运行结果:
总结:由于每次生成的随机数都是相同的,加了随机数种子,使得每次生成的随机数相同
##任务三
代码:
1 #include <iostream> 2 #include <string> 3 #include <algorithm> 4 5 bool is_palindrome(std::string s); 6 7 int main() { 8 using namespace std; 9 string s; 10 11 while(cin >> s) // 多组输入,直到按下Ctrl+Z后结束测试 12 cout << boolalpha << is_palindrome(s) << endl; 13 14 } 15 16 // 函数is_palindrom定义 17 // 待补足 18 // ××× 19 bool is_palindrome(std::string s){ 20 std::string b{s}; 21 reverse(s.begin(),s.end()); 22 if(s == b){ 23 return true; 24 }else{ 25 return false; 26 } 27 }
运行结果:
##任务四
代码:
1 #include <iostream> 2 #include <string> 3 #include <algorithm> 4 using namespace std; 5 6 std::string dec2n(int x, int n = 2); 7 8 int main() { 9 10 11 int x; 12 while(cin >> x) { 13 cout << "十进制: " << x << endl; 14 cout << "二进制: " << dec2n(x) << endl; 15 cout << "八进制: " << dec2n(x, 8) << endl; 16 cout << "十六进制: " << dec2n(x, 16) << endl << endl; 17 } 18 } 19 20 // 函数dec2n定义 21 // 待补足 22 // ××× 23 std::string dec2n(int x, int n){ 24 if(n == 2 || n == 8){ 25 std::string str = ""; 26 while(x / n != 0){ 27 str += char('0'+x%n); 28 x /= n; 29 } 30 str += char('0'+x%n); 31 reverse(str.begin(),str.end()); 32 return str; 33 }else if(n == 16){ 34 char arr[16] = {'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'}; 35 std::string str = ""; 36 while(x / n != 0){ 37 str += arr[x%n]; 38 x /= n; 39 } 40 str += arr[x%n]; 41 reverse(str.begin(),str.end()); 42 return str; 43 } 44 }
运行结果:
##任务五
代码:
1 #include <iostream> 2 #include <string> 3 #include <algorithm> 4 #include <vector> 5 #include <iomanip> 6 using namespace std; 7 8 int main() { 9 cout << " "; 10 vector<char> arr; 11 for(int i = 0;i < 26;i++){ 12 cout << " "; 13 cout << char('a' + i); 14 arr.push_back(char('A' + i)); 15 } 16 cout << endl; 17 for(int i = 1;i <= 26;i++){ 18 cout << setw(2) << setfill(' ') << i; 19 rotate(arr.begin(),arr.begin() + 1,arr.end()); 20 for(auto ele:arr){ 21 cout << " "; 22 cout << ele; 23 } 24 cout << endl; 25 } 26 27 28 return 0; 29 }
运行结果:
##任务六
代码:
1 #include <iostream> 2 #include <string> 3 #include <algorithm> 4 #include <vector> 5 #include <iomanip> 6 #include <ctime> 7 using namespace std; 8 9 int generateRan(int n); 10 11 int main() { 12 srand(time(NULL)); 13 int num = 0; 14 for(int i = 0;i < 10;i++){ 15 int a = rand()%4; 16 num += generateRan(a); 17 } 18 double avg = 1.0*num/10*100; 19 cout << "正确率为:"; 20 cout << fixed << setprecision(2) << avg; 21 cout << "%" << endl; 22 23 24 return 0; 25 } 26 27 int generateRan(int n) { 28 if(n == 0){ 29 int a = rand()%10 + 1; 30 int b = rand()%10 + 1; 31 int res = a + b; 32 int get; 33 cout << a; 34 cout << " + "; 35 cout << b; 36 cout << " = "; 37 cin >> get; 38 if(get == res){ 39 return 1; 40 }else{ 41 return 0; 42 } 43 }else if(n == 1){ 44 int a = rand()%10 + 1; 45 int b,get; 46 do{ 47 b = rand()%10 + 1; 48 }while(b > a); 49 int res = a - b; 50 cout << a; 51 cout << " - "; 52 cout << b; 53 cout << " = "; 54 cin >> get; 55 if(get == res){ 56 return 1; 57 }else{ 58 return 0; 59 } 60 }else if(n == 2){ 61 int a = rand()%10 + 1; 62 int b = rand()%10 + 1; 63 int res = a * b; 64 int get; 65 cout << a; 66 cout << " x "; 67 cout << b; 68 cout << " = "; 69 cin >> get; 70 if(get == res){ 71 return 1; 72 }else{ 73 return 0; 74 } 75 }else if(n == 3){ 76 int a = rand()%10 + 1; 77 int b,get; 78 do{ 79 b = rand()%10 + 1; 80 }while(a % b != 0); 81 int res = a / b; 82 cout << a; 83 cout << " / "; 84 cout << b; 85 cout << " = "; 86 cin >> get; 87 if(get == res){ 88 return 1; 89 }else{ 90 return 0; 91 } 92 } 93 }
运行结果: