笔试2

1、

输入一个字符串,找出优先级最大的N个数字输出。

偶数优先级比奇数大;数字越大优先级越高。

输入示例:555503,772867,756893,339138,399447,40662,859037,628085,855723,974471,599631,636153,581541,174761,948135,411485,554033,858627,402833,546467,574367,360461,566480,755523,222921,164287,420256,40043,977167,543295,944841,917125,331763,188173,353275,175757,950417,284578,617621,546561,913416,258741,260569,630583,252845;10

;后面的数字是N


输出示例:

913416,566480,420256,339138,284578,40662,977167,974471,950417,948135

#include <iostream>
#include <string>
#include <vector>
#include <stack>
using namespace std;

int main(){
    string s;
    cin >> s;
    int N;
    vector<int> a;
    vector<int> b;
    
    int i, value;
    for(int k=0; k< s.length(); k=i+1){
        value = 0;
        i = k;
        while(s[i] != ',' && s[i] != ';'){
            if((s[i] >= '0' && s[i] <= '9'))
                value = value * 10 + s[i] - '0';
            ++i;
        }//while
		
        if(value & 1 == 1)
            a.push_back(value);
        else
            b.push_back(value);
        
	    if(s[i] == ';'){
			i++;
			value = 0;
            while(s[i] != '\0'){
                if((s[i] >= '0' && s[i] <= '9'))
                    value = value * 10 + s[i] - '0';
                i++;
            }
             N = value;
        }
    }//for
	/*
    cout << N << endl;
	for(i=0; i<a.size()-1; ++i){
		cout << a[i]<<",";
	}
	cout << a[i] << endl;
	for(i=0; i<b.size()-1; ++i){
		cout << b[i]<<",";
	}
	cout << b[i] << endl;
	*/
	//cout << b.size() <<endl;
	for(i=0; i< a.size(); ++i){  //a为奇
        for(int j= a.size()-2; j>=i; j--){
            if(a[j] < a[j+1]){
                int tmp = a[j];
                a[j] = a[j+1];
                a[j+1] = tmp;
            }
        }
    }
	
    for(i=0; i< b.size(); ++i){ //b为偶
        for(int j= b.size()-2; j>=i; j--){
            if(b[j] < b[j+1]){
                int tmp = b[j];
                b[j] = b[j+1];
                b[j+1] = tmp;
            }
        }
    }
	/*
	cout << endl;
	for(i=0; i<a.size()-1; ++i){
		cout << a[i]<<",";
	}
	cout << a[i] << endl;
	for(i=0; i<b.size()-1; ++i){
		cout << b[i]<<",";
	}
	cout << b[i] << endl;

*/
    if(N <= b.size()){
        for(i=0; i <=N; ++i){
            cout << b[i] << ",";
        }
        cout << b[N] << endl;
    }
    else if(N > b.size()){
        for(i=0; i<b.size(); ++i){
            cout << b[i] << ",";
        }
        for(i=0; i < N-b.size()-1; ++i){
            cout << a[i] << ",";
        }
        cout << a[i] << endl;
    }
    
    return 0;
}

 

2、

#include <iostream>
#include <vector>
using namespace std;

void d(string s1, string s2, string &s3, string &s4) {
    s3 = s1.substr(1);
    //s4 = s1.substr(1);
}

void l(string s1, string s2, string &s3, string &s4) {
    if (s1.size() > 0) {
        s3 = s1.substr(1);
        s4 = s1.substr(0, 1) + s2;
    }
}

void r(string s1, string s2, string &s3, string &s4) {
    if (s1.size() > 0) {
        s3 = s1.substr(1);
        s4 = s2 + s1.substr(0, 1);
    }
}
void func(string A, string B, string log, string C) {
    if (B == C) {
        cout << log << "\n";
        return;
    }

    if (A.empty())
        return;

    string AA(A), CC(C);
    d(A, C, AA, CC);
    func(AA, B, log + "d ", CC);

    string AA(A), CC(C);
    l(A, C, AA, CC);
    func(AA, B, log + "l ", CC);

    string AA(A), CC(C);
    r(A, C, AA, CC);
    func(AA, B, log + "r ", CC);
}

int main() {
    int S = 0;
    vector<string> A;
    vector<string> B;

    cin >> S;
    for (int i = 0; i < S; ++i) {
        string s1, s2;
        cin >> s1 >> s2;
        A.push_back(s1);
        B.push_back(s2);
    }

    for (int i = 0; i < S; ++i) {
        cout << "{\n";
        func(A[i], B[i], "", "");
        cout << "}\n";
    }

    return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值