题解 | #数据分类处理#

#include <iostream>
using namespace std;
#include <set>
#include <vector>
string num2str(int a) {
    string s1;
    if (a == 0) {
        s1 = '0';
    }
    while (a) {
        s1 += a % 10 + '0';
        a = a / 10;
    }
    return s1;
}


bool isinnum1(int n1, int n2) {//还要改
    string a = num2str(n1), b = num2str(n2);

    //cout<<b<<endl;
    if (a.find(b) == string::npos) {
        return false;
    } else {
        return true;
    }

}

bool isinarry(int* arry, int len, int n) {
    for (int i = 0; i < len; i++) {
        // cout<<isinnum1(arry[i], n)<<endl;
        if (isinnum1(arry[i], n) ) {
            return true;
        }
    }
    return false;
}


int innum(int* arry, int len, int n) {
    int count = 0;
    for (int i = 0; i < len; i++) {
        if (isinnum1(arry[i], n)) {
            count++;
        }
    }
    return count;
}
int main() {

    int a, b;
    cin >> a;
    int* arry1 = new int[a];
    for (int i = 0; i < a; i++) {
        int temp;
        cin >> temp;
        arry1[i] = temp;
    }
    cin >> b;
    set<int> arry2;
    for (int i = 0; i < b; i++) {
        int temp;
        cin >> temp;
        arry2.insert(temp);
    }

    vector<int> res;
    for (auto it = arry2.begin(); it != arry2.end(); it++) {

        if (isinarry(arry1, a, *it)) {
            res.insert(res.end(), *it);
            res.insert(res.end(), innum(arry1, a, *it));
            for (int i = 0; i < a; i++) {
                if (isinnum1(arry1[i], *it)) {
                    res.insert(res.end(), i);
                    res.insert(res.end(), arry1[i]);
                }
            }

        }
    }
    res.insert(res.begin(), res.size());

    for (int i = 0; i < res.size(); i++) {
        cout << res[i] << " ";
    }

//cout<<isinnum1(0, 123)<<endl;
}