[leetcode]9. Palindrome Number@Java解题报告

最新推荐文章于 2020-04-04 08:08:20 发布

JacobGo

最新推荐文章于 2020-04-04 08:08:20 发布

阅读量555

点赞数

分类专栏： leetcode 文章标签： Palindrome Number leetcode

本文链接：https://blog.csdn.net/zjkC050818/article/details/76368157

版权

leetcode 专栏收录该内容

130 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/palindrome-number/description/

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.

题意判断数字是否是回文串，只能用常数空间，不能转换成字符串，不能反转数字。

先计算数字的位数，分别通过除法和取余，提取出要对比的对应数字。

package go.jacob.day730;

/**
 * 9. Palindrome Number
 * 
 * @author Jacob
 */
public class Demo1 {
	/*
	 * 最优解法有木有
	 */
	public boolean isPalindrome(int x) {
		// 如果是负数，或者10的整数倍，返回false
		if (x < 0 || x != 0 && x % 10 == 0)
			return false;
		int reverse = 0;
		while (x > reverse) {
			reverse = reverse * 10 + x % 10;
			x = x / 10;
		}
		return (reverse == x || reverse / 10 == x);
	}
}