实验1 现代C++编程初体验

任务 1:

reverse 无返回值,会改变原容器

reverse_copy不修改原容器

rotate 将一段元素移动至另一段后,分别代表序列起始,支点,末尾

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

template<typename T>
void output(const T &c);
void test1();
void test2();
void test3();
int main() {
    std::cout << "测试1: \n";
    test1();
    std::cout << "\n测试2: \n";
    test2();
    std::cout << "\n测试3: \n";
    test3();
}
// 输出容器对象c中的元素
template <typename T>
void output(const T &c) {
    for(auto &i : c)
        std::cout << i << ' ';
    std::cout << '\n';
}
// 测试1:组合使用算法库、迭代器、string反转字符串
void test1() {
    using namespace std;
    string s0{"0123456789"};
    cout << "s0 = " << s0 << endl;
    string s1(s0);
    // 反转s1自身
    reverse(s1.begin(), s1.end());  
    cout << "s1 = " << s1 << endl;
    string s2(s0.size(), ' ');
    // 将s0反转后结果拷贝到s2, s0自身不变
    reverse_copy(s0.begin(), s0.end(), s2.begin()); 
    cout << "s2 = " << s2 << endl;
}
// 测试2:组合使用算法库、迭代器、vector反转动态数组对象vector内数据
void test2() {
    using namespace std;
    vector<int> v0{2, 0, 4, 9};
    cout << "v0: "; output(v0);
 vector<int> v1{v0};
    reverse(v1.begin(), v1.end());
    cout << "v1: "; output(v1);
    vector<int> v2{v0};
    reverse_copy(v0.begin(), v0.end(), v2.begin());
    cout << "v2: "; output(v2);
}
// 测试3:组合使用算法库、迭代器、vector实现元素旋转移位
void test3() {
    using namespace std;
    vector<int> v0{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
    cout << "v0: "; output(v0);
    vector<int> v1{v0};
    // 将[v1.begin(), v1.end())区间内元素循环左移1位
    rotate(v1.begin(), v1.begin()+1, v1.end());  
    cout << "v1: "; output(v1);
    vector<int> v2{v0}; 
    // 将[v1.begin(), v1.end())区间内元素循环左移2位
    rotate(v2.begin(), v2.begin()+2, v2.end());  
    cout << "v2: "; output(v2);
    vector<int> v3{v0};
    // 将[v1.begin(), v1.end())区间内元素循环右移1位
    rotate(v3.begin(), v3.end()-1, v3.end()); 
     cout << "v3: "; output(v3);
    vector<int> v4{v0};
    // 将[v1.begin(), v1.end())区间内元素循环右移2位
    rotate(v4.begin(), v4.end()-2, v4.end()); 
    cout << "v4: "; output(v4);
}

B60FBBE21B21C964FBC09D510C2C2F20

 

 

 

任务2:

generate:生成指定范围元素值

效率更高

Lambda 表达式适合临时定义简单逻辑

 

 

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <cstdlib>
#include <ctime>
// 模板函数声明
template<typename T>
void output(const T &c);
int generate_random_number();
void test1();
void test2();
int main() {
    std::srand(std::time(0));    // 添加随机种子
    std::cout << "测试1: \n";
    test1();
std::cout << "\n测试2: \n";
    test2();
}
// 输出容器对象c中的元素
template <typename T>
void output(const T &c) {
    for(auto &i: c)
        std::cout << i << ' ';
    std::cout << '\n';
}
// 返回[0, 100]区间内的一个随机整数
int generate_random_number() {
    return std::rand() % 101;
}
// 测试1:对容器类对象指定迭代器区间赋值、排序
void test1() {
    using namespace std;
    vector<int> v0(10);  // 创建一个动态数组对象v0, 对象大小为10
    generate(v0.begin(), v0.end(), generate_random_number); // 生成随机数填充v0
    cout << "v0: "; output(v0);
    vector<int> v1{v0};
    sort(v1.begin(), v1.end()); // 对整个vector排序
    cout << "v1: "; output(v1);
    vector<int> v2{v0};
    sort(v2.begin()+1, v2.end()-1); // 只对中间部分排序,不包含首尾元素
    cout << "v2: "; output(v2);
}
// 测试2:对容器类对象指定迭代器区间赋值、计算最大值/最小值/均值
void test2() {
    using namespace std;
    vector<int> v0(10);  
    generate(v0.begin(), v0.end(), generate_random_number); 
    cout << "v0: "; output(v0);
    // 求最大值和最小值
    auto min_iter = min_element(v0.begin(), v0.end());
    auto max_iter = max_element(v0.begin(), v0.end());
    cout << "最小值: " << *min_iter << endl;
    cout << "最大值: " << *max_iter << endl;
    // 同时求最大值和最小值
    auto ans = minmax_element(v0.begin(), v0.end());
    cout << "最小值: " << *(ans.first) << endl;
    cout << "最大值: " << *(ans.second) << endl;
// 求平均值
    double avg1 = accumulate(v0.begin(), v0.end(), 0.0) / v0.size();
    cout << "均值: " << fixed << setprecision(2) << avg1 << endl;
    sort(v0.begin(), v0.end());
    double avg2 = accumulate(v0.begin()+1, v0.end()-1, 0.0) / (v0.size()-2);
    cout << "去掉最大值、最小值之后,均值: " << avg2 << endl;
}

D8C540488B2F62AAE3B99582833AA7C7

 

任务3:

#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
unsigned char func(unsigned char c);
void test1();
void test2();
int main() {
    std::cout << "测试1: 字符串大小写转换\n";
    test1();
    std::cout << "\n测试2: 字符变换\n";
    test2();
}
unsigned char func(unsigned char c) {
    if(c == 'z')
        return 'a';
    
    if(c == 'Z')
        return 'A';
    
    if(std::isalpha(c))
        return static_cast<unsigned char>(c+1);
    
    return c;
}
void test1() {
    std::string s1{"Hello World 2049!"};
    std::cout << "s1 = " << s1 << '\n';
    std::string s2;
    for(auto c: s1)
        s2 += std::tolower(c);
    std::cout << "s2 = " << s2 << '\n'; 
    std::string s3;
    for(auto c: s1)
        s3 += std::toupper(c);
    std::cout << "s3 = " << s3 << '\n'; 
}
void test2() {
    std::string s1{"I love cosmos!"};
    std::cout << "s1 = " << s1 << '\n';
    
    std::string s2(s1.size(), ' ');
    std::transform(s1.begin(), s1.end(),
                   s2.begin(),
                   func);
    std::cout << "s2 = " << s2 << '\n';
}

6A64999C6FF2AD4ACC2FF6A347DDA9B5

func输出下一个字母,非字母直接输出

分别为将字母转换为小写和大写字母

起始和末尾迭代,目标,函数操作

 目标序列是否与源序列重叠

任务4

bool is_palindrome(const std::string &s) {
    int left = 0;
    int right = s.size() - 1;
    while (left < right) {
      
        if (s[left] != s[right]) {
            return false;
        }
        left++;
        right--;
    }
    return true;
}


bool is_palindrome_ignore_case(const std::string &s) {

    std::string lower_s;
    for (char c : s) {
        lower_s += static_cast<char>(std::tolower(static_cast<unsigned char>(c)));
    }
  
    return is_palindrome(lower_s);
}

D76794F92613A37A243030C3F184C7E2

 

任务5

std::string dec2n(int x, int n) {
    // 特殊情况:x=0时直接返回"0"(避免循环不执行导致空字符串)
    if (x == 0) {
        return "0";
    }

    // 定义基数字符集:0-9对应索引0-9,A-Z对应索引10-35(匹配n=2-36的需求)
    const std::string base_chars = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    std::string result;  // 存储转换后的字符(先逆序,最后反转)

    // 核心转换逻辑:除n取余法
    while (x > 0) {
        int remainder = x % n;  // 求当前余数(对应n进制的一位)
        // 根据余数取对应的字符,追加到结果中(此时是逆序)
        result += base_chars[remainder];
        x = x / n;  // 更新x为商,继续下一轮计算
    }

    // 反转结果:因为除n取余得到的是逆序的n进制数
    std::reverse(result.begin(), result.end());
    return result;
}

C167214BBE56242C90A988F597AD65D0

任务6

#include <iostream>
#include <string>
#include <iomanip> 

int main() {
    std::string first_row = "abcdefghijklmnopqrstuvwxyz";
    std::cout << std::setw(2) << " " << " ";
    for (char c : first_row) {
        std::cout << c << " ";
    }
    std::cout << std::endl;
    for (int row = 1; row <= 26; ++row) {

        std::cout << std::setw(2) << row << " ";
    
        char start_char = 'A' + (row - 1);
        for (int col = 0; col < 26; ++col) {
           
            char current_char = 'A' + (start_char - 'A' + col) % 26;
            std::cout << current_char << " ";
        }
        std::cout << std::endl;
    }

    return 0;
}

425ae89b2e8997df18a86c4358639ae0

任务7

563F52DB27D03B33713AA0D0FF658AFB

#include <iostream>
#include <cstdlib>
#include <ctime>
#include <iomanip>
using namespace std;

int main() {
    srand(static_cast<unsigned int>(time(0)));
    int correctCount = 0;
    for (int i = 0; i < 10; ++i) {
        int num1 = rand() % 10 + 1;
        int num2 = rand() % 10 + 1;
        char op;
        int result;
        int opChoice = rand() % 4;
        switch (opChoice) {
            case 0:
                op = '+';
                result = num1 + num2;
                break;
            case 1:
                op = '-';
                if (num1 < num2) {
                    swap(num1, num2);
                }
                result = num1 - num2;
                break;
            case 2:
                op = '*';
                result = num1 * num2;
                break;
            case 3:
                op = '/';
                while (num2 == 0 || num1 % num2 != 0) {
                    num1 = rand() % 10 + 1;
                    num2 = rand() % 10 + 1;
                }
                result = num1 / num2;
                break;
        }
        cout << num1 << " " << op << " " << num2 << " = ";
        int userAnswer;
        cin >> userAnswer;
        if (userAnswer == result) {
            correctCount++;
        }
    }
    double accuracy = static_cast<double>(correctCount) / 10 * 100;
    cout << "正确率: " << fixed << setprecision(2) << accuracy << "%" << endl;
    return 0;
}

 

posted @ 2025-10-18 01:23  HdYi  阅读(4)  评论(0)    收藏  举报