频道栏目
首页 > 资讯 > 其他 > 正文

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

17-01-04        来源:[db:作者]  
收藏   我要投稿

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;
    }
};
相关TAG标签
上一篇:bzoj 2827 千山鸟飞绝 平衡树
下一篇:程序员面试金典: 9.5位操作 5.7寻找丢失的整数
相关文章
图文推荐

关于我们 | 联系我们 | 广告服务 | 投资合作 | 版权申明 | 在线帮助 | 网站地图 | 作品发布 | Vip技术培训 | 举报中心

版权所有: 红黑联盟--致力于做实用的IT技术学习网站