詳細描述:
將輸入的兩個字符串合併。
對合並後的字符串進行排序,要求爲:下標爲奇數的字符和下標爲偶數的字符分別從小到大排序。
這裏的下標意思是字符在字符串中的位置。
對排訓後的字符串進行操作,如果字符爲‘0’——‘9’或者‘A’——‘F’或者‘a’——‘f’,
則對他們所代表的16進制的數進行BIT倒序的操作,並轉換爲相應的大寫字符。
如字符爲‘4’,爲0100b,則翻轉後爲0010b,也就是2。轉換後的字符爲‘2’;
如字符爲‘7’,爲0111b,則翻轉後爲1110b,也就是e。轉換後的字符爲大寫‘E’。
舉例:輸入str1爲"dec",str2爲"fab",合併爲“decfab”,
分別對“dca”和“efb”進行排序,排序後爲“abcedf”,轉換後爲“5D37BF”
樣例輸入:
dec fab
樣例輸出:
5D37BF
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s1, s2;
char sinChar[100], douChar[100];
char arr[16] = {'0','8','4','C','2','A','6','E','1','9','5','D','3','B','7','F'};
cin>>s1>>s2;
string s = s1 + s2;
//cout<<s<<endl;
int len = s.length();
int jishu = len/2 + len%2, oushu = len/2;
for(int i = 0; i < jishu; i++)
sinChar[i] = s[2*i];
for(int i = 0; i < oushu; i++)
douChar[i] = s[2*i+1];
sort(sinChar, sinChar + jishu);
sort(douChar, douChar + oushu);
/*
for(int i = 0; i < jishu; i++)
cout<<sinChar[i];
cout<<endl;
for(int i = 0; i < oushu; i++)
cout<<douChar[i];
cout<<endl;
*/
for(int i = 0; i < jishu; i++){
char cc = sinChar[i];
if(cc >= '0' && cc <= '9') sinChar[i] = arr[cc - '0'];
else if(cc >= 'a' && cc<= 'f') sinChar[i] = arr[ cc - 'a' + 10];
else if(cc >= 'A' && cc<= 'F') sinChar[i] = arr[ cc - 'A' + 10];
}
for(int i = 0; i < oushu; i++){
char cc = douChar[i];
if(cc >= '0' && cc <= '9') douChar[i] = arr[cc - '0'];
else if(cc >= 'a' && cc<= 'f') douChar[i] = arr[ cc - 'a' + 10];
else if(cc >= 'A' && cc<= 'F') douChar[i] = arr[ cc - 'A' + 10];
}
for(int i = 0; i < oushu; i++)
cout<<sinChar[i]<<douChar[i];
if(len%2 == 1) cout<<sinChar[jishu-1];
cout<<endl;
return 0;
}
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
void sort( string& word, int old );
void ProcessString( string& word );
int main( void )
{
string word1, word2;
cin >> word1 >> word2;
word1.append( word2 );
sort( word1, 0 );
sort( word1, 1 );
ProcessString( word1 );
cout << word1 << endl;
return 0;
}
void sort( string& word, int old )
{
char tmp;
int nMax;
for( nMax = old; nMax < word.length(); nMax += 2 )
;
nMax -= 2;
for( int i = nMax; i > old; i -= 2 ){
bool flag = false;
for( int j = old; j < i; j += 2 ){
if( word[j] > word[j + 2] ){
tmp = word[j];
word[j] = word[j + 2];
word[j + 2] = tmp;
flag = true;
}
}
if( !flag )
break;
}
}
void ProcessString( string& word )
{
char ch1, ch2, bit, bFlag;
for( string::iterator it = word.begin();
it != word.end(); ++it ){
ch2 = 0; //給char ch2賦初值爲0
bit = 1;
bFlag = 1;
if( isdigit( *it ) ){
ch1 = *it - '0';
}else if( *it >= 'a' && *it <= 'f' ){
ch1 = *it - 'a' + 10;
}else if( *it >= 'A' && *it <= 'F' ){
ch1 = *it - 'A' + 10;
}else{
bFlag = 0;
}
if( bFlag ){
ch2 |= ( ch1 & ( 1 << 0 ) ) << 3;
ch2 |= ( ch1 & ( 1 << 1 ) ) << 1;
ch2 |= ( ch1 & ( 1 << 2 ) ) >> 1;
ch2 |= ( ch1 & ( 1 << 3 ) ) >> 3;
if( ch2 < 10 ){
*it = '0' + ch2; //返回其字符
}else{
*it = 'A' + ch2 - 10;
}
}
}
}