回文数字判定

@[算法题解]

09 - Is Palindrome

题目描述

• 回文数字判定
• 思路：

•  1. 排除特殊情况
  

•  1.1 负数
  

•  XXX发现不需要判，2在判断的时候直接通过相等判断就能判出 XXX1.2 末位为0的(需要先有数组才能方便取到末位)
  

•  2. 将数字存入数组中（此时计算出数字的）
  

•  2.1 双指针遍历比较，凡是不等直接判false
  

•  2.2 遍历到循环条件结束，判true
  

• 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 = 10
• Output: false
• Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
• Example 4:
• Input: x = -101
• Output: false
• Constraints:
• -231 <= x <= 231 - 1
• Follow up: Could you solve it without converting the integer to a string?
• 来源&