15.1—细节实现题—Reverse Integer

描述
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Have you thought about this?
Here are some good questions to ask before coding. Bonus points for you if you have already thought
through this!
If the integer’s last digit is 0, what should the output be? ie, cases such as 10, 100.
Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then
the reverse of 1000000003 overflows. How should you handle such cases?
row an exception? Good, but what if throwing an exception is not an option? You would then have
to re-design the function (ie, add an extra parameter).

#include<iostream>#include<vector>#include<string>#include<cmath>using namespace std;string ReverseInte(int data){string res;if (data < 0){res.push_back('-');data = abs(data);}int temp = 0;bool flag = false;;while (data){temp++;int lastbit = data % 10;if(temp&&lastbit){flag = true;}if (flag)res.push_back(lastbit + '0');data = data / 10;}return res;}int main(){int data = -188900;string res = ReverseInte(data);cout << res << endl;}