码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode Palindrome Number

时间:2014-10-25 09:21:10      阅读:182      评论:0      收藏:0      [点我收藏+]

标签:style   http   io   ar   java   strong   sp   div   on   

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

click to show spoilers.

Some hints:

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

If you are thinking of converting the integer to string, note the restriction of using extra space.

You could also try reversing an integer. However, if you have solved the problem "Reverse Integer", you know that the reversed integer might overflow. How would you handle such case?

There is a more generic way of solving this problem.


挺简单的题目,把该串逆置然后对比原来的看是否相等,相等就输出true;


代码:


public class Solution {
    public boolean isPalindrome(int x) {
       if(x<0)
	    return false;
	   if(x==0)
	    return true;
	   int cur=x;
	   int rev=0;
	   while(cur!=0)
	   {
	       rev=rev*10+cur%10; //逆序
	       cur/=10;
	   }
	   if(x==rev)
	       return true;
	       else
	       return false;
    }
}


LeetCode Palindrome Number

标签:style   http   io   ar   java   strong   sp   div   on   

原文地址:http://blog.csdn.net/zhuangjingyang/article/details/40436425

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!