LeetCode-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?
Throw 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).
这题很神奇,边界都不需要考虑
class Solution { public : int reverse( int x) { // Start typing your C/C++ solution below // DO NOT write int main() function if (x/10==0) return x; bool flag=x>0; if (!flag)x=-x; vector< int > digits; while (x!=0){ digits.push_back(x%10); x/=10; } int ret=0; for ( int i=0;i<digits.size();i++){ ret*=10; ret+=digits[i]; } if (!flag)ret=-ret; return ret; } }; |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步