关闭

【LeetCode OJ 009】Palindrome Number

标签: LeetCode
302人阅读 评论(0) 收藏 举报
分类:

题目链接:https://leetcode.com/problems/palindrome-number/

题目:

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

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?

示例代码:

public class Solution 
{
    public boolean isPalindrome(int x)
    {
    	if(x<0)
    		return false;
    	List<Integer> list=new LinkedList<Integer>();
    	int temp;
    	int m=x;
    	//从个位开始取出每一位数,放入LinkedList中
    	while(m>0)
    	{
    		temp=m%10;
    		list.add(temp);
    		m=m/10;
    	}
    	int sum=0;
    	//从LinkedList中依次取出每一位数组成的新数即为x的逆序数
		for(int i:list)
		{
			sum=sum*10+i;
		}
		//比较是否相等即可判断
		if(x==sum)
		{
			return true;
		}
		else 
		{
			return false;
		}
    }
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:72214次
    • 积分:1412
    • 等级:
    • 排名:千里之外
    • 原创:79篇
    • 转载:3篇
    • 译文:1篇
    • 评论:6条
    博客专栏
    最新评论