Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g0501_0600.s0564_find_the_closest_palindrome.Solution

```
public class Solution
extends Object
```
564 - Find the Closest Palindrome.
Hard

Given a string n representing an integer, return the closest integer (not including itself), which is a palindrome. If there is a tie, return the smaller one.

The closest is defined as the absolute difference minimized between two integers.

Example 1:

Input: n = “123”

Output: “121”

Example 2:

Input: n = “1”

Output: “0”

Explanation: 0 and 2 are the closest palindromes but we return the smallest which is 0.

Constraints:
- 1 <= n.length <= 18
- n consists of only digits.
- n does not have leading zeros.
- n is representing an integer in the range [1, 10¹⁸ - 1].

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  String nearestPalindromic(String n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

nearestPalindromic

public String nearestPalindromic(String n)