Package g0001_0100.s0009_palindrome_number

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    9 - Palindrome Number.

    Easy

    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:

    • <code>-2<sup>31</sup><= x <= 2<sup>31</sup> - 1</code>

    Follow up: Could you solve it without converting the integer to a string?

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean isPalindrome(Integer x)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait