2017年5月28日
[LeetCode] 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 阅读全文
posted @ 2017-05-28 11:30 Grandyang 阅读(8300) 评论(1) 推荐(0)
Fork me on GitHub