首页 > 其他 > 详细

[Math]Reverse Integer

时间:2015-12-13 20:22:58      阅读:129      评论:0      收藏:0      [点我收藏+]
Total Accepted: 111287 Total Submissions: 474471 Difficulty: Easy

 

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

click to show spoilers.

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?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

 
class Solution {
public:
    int reverse(int x) {
        int sign = 1;
        if(x<0) {
            sign=-1;
            x=-x;
        }
        long long int res = 0;
        while(x){
            res = res*10 + x%10;
            x/=10;
        }
        res *= sign;
        res = res>INT_MAX || res<INT_MIN ? 0:res;
        return res;
    }
};

[Math]Reverse Integer

原文:http://www.cnblogs.com/zengzy/p/5043402.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!