回文数字(Palindrome Number)

最新推荐文章于 2024-08-27 16:45:27 发布

woniu317

最新推荐文章于 2024-08-27 16:45:27 发布

阅读量743

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/woniu317/article/details/87874085

版权

LeetCode 专栏收录该内容

25 篇文章 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.

我的代码

方法一：

func isPalindrome(x int) bool {
	if x < 0 {
		return false
	}
	str := strconv.Itoa(x)
	lenth := len(str)
	for i := 0; i < lenth/2; i++ {
		if str[i] != str[lenth-i-1] {
			return false
		}
	}
	return true
}

方法二：

func isPalindrome(x int) bool {
	if x < 0 {
		return false
	}
	lenth := 0
	tmp := x
	revertedNumber := 0
	for ; tmp > 0; tmp = tmp / 10 {
		revertedNumber = revertedNumber*10 + tmp%10
		lenth++
	}
	return revertedNumber == x
}

方法三：

func isPalindrome(x int) bool {
    if x < 0||(x%10==0&&x!=0) {
		return false
	}
	
	revertedNumber := 0
	for x>revertedNumber {
		revertedNumber = revertedNumber*10 + x%10
        x=x/10
	}
	return revertedNumber==x || revertedNumber/10==x
}