feat: add java and python solutions to lcci question

添加《程序员面试金典题解》：面试题 16.06. 最小差

Author: yanglbme

lcci/16.06.Smallest Difference/README.md

@@ -23,14 +23,41 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def smallestDifference(self, a: List[int], b: List[int]) -> int:
+        a.sort()
+        b.sort()
+        i, j, res = 0, 0, 2147483647
+        m, n = len(a), len(b)
+        while i < m and j < n:
+            if a[i] == b[j]: return 0
+            res = min(res, abs(a[i] - b[j]))
+            if a[i] > b[j]: j += 1
+            else: i += 1
+        return res
+        
 ```
 
 ### Java
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int smallestDifference(int[] a, int[] b) {
+        Arrays.sort(a);
+        Arrays.sort(b);
+        int m = a.length, n = b.length;
+        int i = 0, j = 0;
+        long res = Long.MAX_VALUE;
+        while (i < m && j < n) {
+            if (a[i] == b[j]) return 0;
+            res = Math.min(res, Math.abs((long) a[i] - (long) b[j]));
+            if (a[i] > b[j]) ++j;
+            else ++i;
+        }
+        return (int) res;
+    }
+}
 ```
 
 ### ...

lcci/16.06.Smallest Difference/README_EN.md

@@ -38,13 +38,40 @@
 ### Python3
 
 ```python
-
+class Solution:
+    def smallestDifference(self, a: List[int], b: List[int]) -> int:
+        a.sort()
+        b.sort()
+        i, j, res = 0, 0, 2147483647
+        m, n = len(a), len(b)
+        while i < m and j < n:
+            if a[i] == b[j]: return 0
+            res = min(res, abs(a[i] - b[j]))
+            if a[i] > b[j]: j += 1
+            else: i += 1
+        return res
+        
 ```
 
 ### Java
 
 ```java
-
+class Solution {
+    public int smallestDifference(int[] a, int[] b) {
+        Arrays.sort(a);
+        Arrays.sort(b);
+        int m = a.length, n = b.length;
+        int i = 0, j = 0;
+        long res = Long.MAX_VALUE;
+        while (i < m && j < n) {
+            if (a[i] == b[j]) return 0;
+            res = Math.min(res, Math.abs((long) a[i] - (long) b[j]));
+            if (a[i] > b[j]) ++j;
+            else ++i;
+        }
+        return (int) res;
+    }
+}
 ```
 
 ### ...

lcci/16.06.Smallest Difference/Solution.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int smallestDifference(int[] a, int[] b) {
+        Arrays.sort(a);
+        Arrays.sort(b);
+        int m = a.length, n = b.length;
+        int i = 0, j = 0;
+        long res = Long.MAX_VALUE;
+        while (i < m && j < n) {
+            if (a[i] == b[j]) return 0;
+            res = Math.min(res, Math.abs((long) a[i] - (long) b[j]));
+            if (a[i] > b[j]) ++j;
+            else ++i;
+        }
+        return (int) res;
+    }
+}

lcci/16.06.Smallest Difference/Solution.py

@@ -0,0 +1,13 @@
+class Solution:
+    def smallestDifference(self, a: List[int], b: List[int]) -> int:
+        a.sort()
+        b.sort()
+        i, j, res = 0, 0, 2147483647
+        m, n = len(a), len(b)
+        while i < m and j < n:
+            if a[i] == b[j]: return 0
+            res = min(res, abs(a[i] - b[j]))
+            if a[i] > b[j]: j += 1
+            else: i += 1
+        return res
+