fd

Author: dingjikerbo

README.md

@@ -377,6 +377,7 @@
 |547|[Friend Circles](https://leetcode.com/problems/friend-circles/)|[Java](leetcode/solution/src/FriendCircles.java)|70||
 |557|[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)| [Java](leetcode/solution/src/ReverseWordsInAStringIII.java)|100||
 |560|[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)| [Java](leetcode/solution/src/SubarraySumEqualsK.java)|70||
+|564|[Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome/)|[Java](leetcode/solution/src/FindTheClosestPalindrome.java)|80|此题暴力法即可|
 |606|[Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/)|[Java](leetcode/solution/src/ConstructStringFromBinaryTree.java)|90||
 |617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)|[Java](leetcode/solution/src/MergeTwoBinaryTrees.java)|100|很简单|
 |621|[Task Scheduler](https://leetcode.com/problems/task-scheduler/)|[Java](leetcode/solution/src/TaskScheduler.java)|70||

leetcode/solution/src/FindTheClosestPalindrome.java

@@ -0,0 +1,28 @@
+public class FindTheClosestPalindrome {
+
+    /**
+     * 此题只给出暴力法
+     * 此种题目太math了，一般不会问
+     */
+    public String nearestPalindromic(String n) {
+        long val = Long.parseLong(n);
+        for (int i = 0; ; i++) {
+            long k1 = val - i, k2 = val + i;
+            if (isPalindrome(k1)) {
+                return String.valueOf(k1);
+            }
+            if (isPalindrome(k2)) {
+                return String.valueOf(k2);
+            }
+        }
+    }
+
+    private boolean isPalindrome(long k) {
+        long x = k, rev = 0;
+        for ( ; k > 0; ) {
+            rev = rev * 10 + k % 10;
+            k /= 10;
+        }
+        return rev == x;
+    }
+}

leetcode/src/Main.java

@@ -4,32 +4,33 @@ public class Main {
 
     public static class Solution {
 
-
-
-    }
-
-    class KthLargest {
-
-        Queue<Integer> queue = new PriorityQueue<>();
-        int capacity;
-
-        public KthLargest(int k, int[] nums) {
-            capacity = k;
-            for (int n : nums) {
-                queue.offer(n);
+        public String nearestPalindromic(String n) {
+            long val = Long.parseLong(n);
+            for (int i = 0; ; i++) {
+                long k1 = val - i, k2 = val + i;
+                if (isPalindrome(k1)) {
+                    return String.valueOf(k1);
+                }
+                if (isPalindrome(k2)) {
+                    return String.valueOf(k2);
+                }
             }
         }
 
-        public int add(int val) {
-            queue.offer(val);
-            while (queue.size() > capacity) {
-                queue.poll();
+        private boolean isPalindrome(long k) {
+            long x = k, rev = 0;
+            for ( ; k > 0; ) {
+                rev = rev * 10 + k % 10;
+                k /= 10;
             }
-            return queue.peek();
+            return rev == x;
         }
+
     }
 
     public static void main(String[] args) {
         Solution solution = new Solution();
+        String s = solution.nearestPalindromic("807045053224792883");
+        System.out.println(s);
     }
 }