leetcode: reverse-integer

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;
    }
};
阅读更多
文章标签: c++ leetcode
个人分类: C++
上一篇leetcode : jumpgame
下一篇hadoop2.60+ubuntu14.04+vmare12+w10配置分布式。vmware桥接模式不可用该怎么办?
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭