题解 | #数字颠倒#

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

using namespace std;

/*
思路1：STL的字符串反向排序
*/
string reverseInt1(int in)
{
    string strIn = to_string(in);
    reverse(strIn.begin(), strIn.end());
    return strIn;
}

/*
思路1：反向输出
*/
string reverseInt2(int in)
{
    string strIn = to_string(in);
    string strOut;
    for(int i = strIn.length() -1; i >= 0; i--) {
        strOut += strIn[i];
    }
    return strOut;
}

int main()
{
    int in;
    while(cin>>in) {
        //cout<<reverseInt1(in)<<endl;
        cout<<reverseInt2(in)<<endl;
    }
}