arjhe / leetcode Goto Github PK

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

int reverse(int x) {
    if (x == 0)
        return 0;
    string s = to_string(x);
    string res;
    
    // just like scan from rightside
    bool isPos = isdigit(s[0]);
    s = isPos ? s : s.substr(1, s.length() - 1);
    int l = s.length();
    bool islastconstZero = (s[s.length()-1] == '0') ? true : false ;
    int i = 0;
    while (i < l) {
        islastconstZero = (islastconstZero && s[s.length() - 1 - i] == '0') ? true : false;
        if (!islastconstZero)
            res += s[s.length() - 1 - i];
        i++;
    }

    res = isPos ? res : '-' + res;
    return stoi(res);
}

int main() {
    cout << reverse(1534236469) << endl;
    return 0;
}