关闭

[LeetCode 7]Reverse Integer(处理整数溢出)

标签: leetcode
147人阅读 评论(0) 收藏 举报

题目内容

7.Reverse Interger
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.

Update (2014-11-10):
Test cases had been added to test the overflow behavior.
问题来源

问题简述

翻转一个整数

题目分析

翻转整数时使用变量迭代是一个较为简单的方法,即按照从低位到高位的顺序,对于整数的每一位维护一个变量,每次将该变量乘以十并加上该位数字。关键在于根据题目的提示在返回结果前加上对于结果溢出情况下的讨论。由此,在定义结果变量是应将其表示范围定义得更大一些,便于处理该情况。

代码示例

#include<limits.h>
class Solution {
public:
    int reverse(int x) {
        long long sum = 0; 
        while(x != 0)
        {
            int temp = x % 10;
            sum = sum * 10 + temp;
            x/=10;
        }
        if (sum>INT_MAX||sum<INT_MIN)
            return 0;
        return (int)sum;
    }
};
0
0

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