关闭

7. Reverse Integer 一个简单但是非常考察思维全面性的题目。

标签: math
92人阅读 评论(0) 收藏 举报
分类:

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 ans = 0; 
        int temp;
        while(x){
            temp = ans * 10 + x % 10;
            if(temp / 10 != ans) return 0;//如果temp overflow,return 0
            ans = temp;
            x /= 10;
        }
        return ans;
    }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:12538次
    • 积分:1066
    • 等级:
    • 排名:千里之外
    • 原创:99篇
    • 转载:5篇
    • 译文:0篇
    • 评论:0条