【LeetCode】number 9: Palindrome Number 验证回文数字

问题

Given an integer x, return true if x is palindrome integer.

An integer is a palindrome when it reads the same backward as forward. For example, 121 is palindrome while 123 is not.
Example 1:

Input: x = 121
Output: true

Example 2:

Input: x = -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: x = 121
Output: true

Example 4:

Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

二、解析

1、判断x是否为负数
2、回文数的最高位不能为0，整数末尾为0的返回false

Go 解法

解法一：

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

解法二：
要验证回文数，需要判断前后半段是否对称，只需翻转后半段，判断和前半段是否相等

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