华为OJ_2168_字符串排序

样例输入:
edcbazfghij
               
样例输出:
abcdezjihgf

#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>

using namespace std;


string& sortDoubleStr( string& str );

int main( void )
{
	string word;
	cin >> word;

	cout << sortDoubleStr( word ) << endl;

	return 0;
}

bool isBigger( char ch1, char ch2 )
{
	return ( ch1 > ch2 );
}
string& sortDoubleStr( string& str )
{
	string::iterator itBgn1,itEnd1, itBgn2, itEnd2;
	itBgn1 = str.begin();
	itEnd2 = str.end();

	int nLen = str.length();
	int nLenHalf = nLen / 2;
	itEnd1 = itBgn1;
	for( int i = 0; i < nLenHalf; ++i ){
		++itEnd1;
	}
	sort( itBgn1, itEnd1 );

	itBgn2 = itEnd1;
	if( nLen % 2 != 0 )
		++itBgn2;
	sort( itBgn2, itEnd2, isBigger );

	return str;
}