蓝桥杯 1483: [蓝桥杯][算法提高VIP]数组替换 Easy only once *注意情况枚举

基本思想：

没啥可说的，但是还是按照题目乖乖来，直接输出可能会导致情况考虑缺失；

注意的有两钟用例情况：

1.a为空，或者m为0；

2.a的长度大于M+N；

关键点：

无；

#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<vector> 
#include<string>
#include<math.h>
#include<algorithm>
#include<cstring>
using namespace std;



int main(){
    int n, m;
    cin >> n >> m;
    int s;
    vector<int>a;
    vector<int>b;
    for (int i = 0; i < n; i++) {
        cin >> s;
        a.push_back(s);
    }
    for (int i = 0; i < m; i++) {
        cin >> s;
        b.push_back(s);
    }
    cin >> n >> m;
    bool flag = true;
    for (int i = 0; i < n; i++) {
        flag = false;
        if (i == 0)
            cout << a[i];
        else
            cout << "," << a[i];
    }
    for (int i = 0; i < m; i++) {
        if (flag) {
            cout << b[i];
            flag = false;
        }
        else {
            cout << "," << b[i];
        }
    }
    if (n + m <= a.size()) {
        for (int i = n + m; i < a.size(); i++) {
            if(i==0)
                cout << a[i];
            else
                cout << "," << a[i];
        }
    }
    return 0;
}

扫描二维码关注公众号，回复： 9037635 查看本文章