LeetCode——Palindrome Number

最新推荐文章于 2020-06-19 10:56:37 发布

yjfanling

最新推荐文章于 2020-06-19 10:56:37 发布

阅读量187

点赞数

分类专栏：算法文章标签： java leetcode

本文链接：https://blog.csdn.net/sinat_22994595/article/details/87890341

版权

算法专栏收录该内容

83 篇文章 0 订阅

订阅专栏

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:
Input: 121
Output: true
Example 2:
Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
Example 3:
Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Follow up:

Coud you solve it without converting the integer to a string?

解法一

若小于0直接返回false，若大于0，将x翻转然后比对翻转前后是否相等

 public boolean isPalindrome(int x) {
	    if(x<0)
			return false;
		int tmp=reverse(x);
		return tmp==x?true:false;
	}
	public int reverse(int x)
	{
		int res=0;
		while(x!=0)
		{
			res=res*10+x%10;
			x=x/10;
		}
		return res;
	}

Runtime: 76 ms, faster than 91.46% of Java online submissions for Palindrome Number.
Memory Usage: 40.4 MB, less than 68.47% of Java online submissions for Palindrome Number.

解法二

回文的特点是对称，判断前后是否对称相等即可

public boolean isPalindrome(int x) {
		if(x<0||(x!=0&&x%10==0))
			return false;
		int tmp=0;
		while(x>tmp)
		{
			tmp=tmp*10+x%10;
			x=x/10;
		}
		return x==tmp||x==tmp/10;
	}

Runtime: 71 ms, faster than 99.88% of Java online submissions for Palindrome Number.
Memory Usage: 39.6 MB, less than 84.24% of Java online submissions for Palindrome Number.