首页 > 其他 > 详细

9. Palindrome Number

时间:2016-05-30 10:00:00      阅读:109      评论:0      收藏:0      [点我收藏+]

Determine whether an integer is a palindrome. Do this without extra space.

Some hints:

Could negative integers be palindromes? (ie, -1)

public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0) return false;
        
        int ret = reverse(x);
         if(ret == x) return true;
         else return false;
    }
    
    public int reverse(int x) {
        long ret = 0; //long in order to avoid overflow
        
        if(x == java.lang.Integer.MIN_VALUE) return 0; //Avoid overflow
        x = Math.abs(x);
        while(x != 0){
            ret = ret *10 + x%10;
            x /= 10;
        }

        if(ret > java.lang.Integer.MAX_VALUE || ret < java.lang.Integer.MIN_VALUE) return 0;
        return (int) ret;
    }
}

 

9. Palindrome Number

原文:http://www.cnblogs.com/qionglouyuyu/p/5541331.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!