feat: add python and java solutions to lcof question

添加《剑指 Offer》题解：面试题59 - I. 滑动窗口的最大值

Author: yanglbme

lcof/面试题59 - I. 滑动窗口的最大值/README.md

@@ -29,20 +29,55 @@
 
 ## 解法
 <!-- 这里可写通用的实现逻辑 -->
-
+双端队列实现。
 
 ### Python3
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Solution:
+    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
+        q, res = [], []
+        for i, num in enumerate(nums):
+            while len(q) != 0 and nums[q[-1]] <= num:
+                q.pop(-1)
+            q.append(i)
+
+            if q[0] == i - k:
+                q = q[1:]
+            if i >= k - 1:
+                res.append(nums[q[0]])
+        return res
 
 ```
 
 ### Java
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[] maxSlidingWindow(int[] nums, int k) {
+        int index = 0, n = nums.length;
+        if (k == 0 || n == 0) {
+            return new int[0];
+        }
+        int[] res = new int[n - k + 1];
+        LinkedList<Integer> q = new LinkedList<>();
+        for (int i = 0; i < n; ++i) {
+            while (!q.isEmpty() && nums[q.peekLast()] <= nums[i]) {
+                q.pollLast();
+            }
+            q.addLast(i);
+            if (q.peekFirst() == i - k) {
+                q.pollFirst();
+            }
+            if (i >= k - 1) {
+                res[index++] = nums[q.peekFirst()];
+            }
+        }
+        return res;
+    }
+}
 ```
 
 ### ...

lcof/面试题59 - I. 滑动窗口的最大值/Solution.java

@@ -0,0 +1,23 @@
+class Solution {
+    public int[] maxSlidingWindow(int[] nums, int k) {
+        int index = 0, n = nums.length;
+        if (k == 0 || n == 0) {
+            return new int[0];
+        }
+        int[] res = new int[n - k + 1];
+        LinkedList<Integer> q = new LinkedList<>();
+        for (int i = 0; i < n; ++i) {
+            while (!q.isEmpty() && nums[q.peekLast()] <= nums[i]) {
+                q.pollLast();
+            }
+            q.addLast(i);
+            if (q.peekFirst() == i - k) {
+                q.pollFirst();
+            }
+            if (i >= k - 1) {
+                res[index++] = nums[q.peekFirst()];
+            }
+        }
+        return res;
+    }
+}

lcof/面试题59 - I. 滑动窗口的最大值/Solution.py

@@ -0,0 +1,13 @@
+class Solution:
+    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
+        q, res = [], []
+        for i, num in enumerate(nums):
+            while len(q) != 0 and nums[q[-1]] <= num:
+                q.pop(-1)
+            q.append(i)
+
+            if q[0] == i - k:
+                q = q[1:]
+            if i >= k - 1:
+                res.append(nums[q[0]])
+        return res