关闭

leetcode: reverse-integer

标签: c++leetcode
74人阅读 评论(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?

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) {
        int r = 0;
        
        for(;x;x/=10)
        {
        r = r*10+x%10;
        }
        return r;
    }
};
0
0

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