LeetCode-9. Palindrome Number | 回文数

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 = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
Example 4:

Input: x = -101
Output: false
 

Constraints:
-2^31 <= x <= 2^31 - 1

func isPalindrome(x int) bool {
    xs := strconv.Itoa(x) // 整型转换为字符串
	for i, j := 0, len(xs)-1; i < j; i, j = i+1, j-1 {
		//i从左开始，j从右开始，i递增，j递减，逐个判断下标i和j对应的数字是否相等
		if xs[i] != xs[j] {
			return false
		}
	}
	return true
}

leetcode-cn执行：
执行用时：28 ms, 在所有 Go 提交中击败了26.90%的用户
内存消耗：5.3 MB, 在所有 Go 提交中击败了19.58%的用户

leetcode执行：
Runtime: 28 ms, faster than 21.90% of Go online submissions for Palindrome Number.
Memory Usage: 5.6 MB, less than 14.02% of Go online submissions for Palindrome Number.