【LeetCode OJ 009】Palindrome Number

题目链接: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;
		}
    }
}


阅读更多
文章标签: LeetCode
个人分类: LeetCode
所属专栏: LeetCode题解
上一篇【LeetCode OJ 228】Summary Ranges
下一篇【LeetCode OJ 011】Container With Most Water
想对作者说点什么? 我来说一句

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

关闭
关闭