README
¶
564. Find the Closest Palindrome
题目
Given an integer n, find the closest integer (not including itself), which is a palindrome.
The 'closest' is defined as absolute difference minimized between two integers.
Example 1:
Input: "123"
Output: "121"
Note:
- The input n is a positive integer represented by string, whose length will not exceed 18.
- If there is a tie, return the smaller one as answer.
解题思路
见程序注释
Documentation
¶
There is no documentation for this package.
Click to show internal directories.
Click to hide internal directories.