feat: add python and java solutions to lcof problem: No.059

Author: yanglbme

README.md

@@ -118,6 +118,7 @@
 
 1. [有效的括号](/solution/0000-0099/0020.Valid%20Parentheses/README.md)
 1. [最小栈](/solution/0100-0199/0155.Min%20Stack/README.md)
+1. [队列的最大值](/lcof/面试题59%20-%20II.%20队列的最大值/README.md)
 1. [用栈实现队列](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md)
 1. [用队列实现栈](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md)
 1. [逆波兰表达式求值](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md)

lcof/面试题59 - II. 队列的最大值/README.md

@@ -44,28 +44,38 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+from collections import deque
+
+
 class MaxQueue:
 
     def __init__(self):
-        self.p = []
-        self.q = []
+        self.p = deque()
+        self.q = deque()
 
     def max_value(self) -> int:
         return -1 if not self.q else self.q[0]
 
     def push_back(self, value: int) -> None:
         while self.q and self.q[-1] < value:
-            self.q.pop(-1)
-        self.q.append(value)
+            self.q.pop()
         self.p.append(value)
-
+        self.q.append(value)
 
     def pop_front(self) -> int:
-        if not self.p: return -1
-        res = self.p.pop(0)
-        if res == self.q[0]:
-            self.q.pop(0)
+        if not self.p:
+            return -1
+        res = self.p.popleft()
+        if self.q[0] == res:
+            self.q.popleft()
         return res
+
+
+# Your MaxQueue object will be instantiated and called as such:
+# obj = MaxQueue()
+# param_1 = obj.max_value()
+# obj.push_back(value)
+# param_3 = obj.pop_front()
 ```
 
 ### **Java**
@@ -74,12 +84,12 @@ class MaxQueue:
 
 ```java
 class MaxQueue {
-
-    private Queue<Integer> p = new ArrayDeque<>();
-    private Deque<Integer> q = new ArrayDeque<>();
+    private Deque<Integer> p;
+    private Deque<Integer> q;
 
     public MaxQueue() {
-
+        p = new ArrayDeque<>();
+        q = new ArrayDeque<>();
     }
 
     public int max_value() {
@@ -90,18 +100,14 @@ class MaxQueue {
         while (!q.isEmpty() && q.peekLast() < value) {
             q.pollLast();
         }
-        q.addLast(value);
-        p.add(value);
+        p.offerLast(value);
+        q.offerLast(value);
     }
 
     public int pop_front() {
-        if (p.isEmpty()) {
-            return -1;
-        }
-        int res = p.poll();
-        if (res == q.peekFirst()) {
-            q.pollFirst();
-        }
+        if (p.isEmpty()) return -1;
+        int res = p.pollFirst();
+        if (q.peek() == res) q.pollFirst();
         return res;
     }
 }

lcof/面试题59 - II. 队列的最大值/Solution.java

@@ -1,10 +1,10 @@
 class MaxQueue {
-
-    private Queue<Integer> p = new ArrayDeque<>();
-    private Deque<Integer> q = new ArrayDeque<>();
+    private Deque<Integer> p;
+    private Deque<Integer> q;
 
     public MaxQueue() {
-
+        p = new ArrayDeque<>();
+        q = new ArrayDeque<>();
     }
 
     public int max_value() {
@@ -15,18 +15,14 @@ public void push_back(int value) {
         while (!q.isEmpty() && q.peekLast() < value) {
             q.pollLast();
         }
-        q.addLast(value);
-        p.add(value);
+        p.offerLast(value);
+        q.offerLast(value);
     }
 
     public int pop_front() {
-        if (p.isEmpty()) {
-            return -1;
-        }
-        int res = p.poll();
-        if (res == q.peekFirst()) {
-            q.pollFirst();
-        }
+        if (p.isEmpty()) return -1;
+        int res = p.pollFirst();
+        if (q.peek() == res) q.pollFirst();
         return res;
     }
 }

lcof/面试题59 - II. 队列的最大值/Solution.py

@@ -1,22 +1,32 @@
+from collections import deque
+
+
 class MaxQueue:
 
     def __init__(self):
-        self.p = []
-        self.q = []
+        self.p = deque()
+        self.q = deque()
 
     def max_value(self) -> int:
         return -1 if not self.q else self.q[0]
 
     def push_back(self, value: int) -> None:
         while self.q and self.q[-1] < value:
-            self.q.pop(-1)
-        self.q.append(value)
+            self.q.pop()
         self.p.append(value)
-        
+        self.q.append(value)
 
     def pop_front(self) -> int:
-        if not self.p: return -1
-        res = self.p.pop(0)
-        if res == self.q[0]:
-            self.q.pop(0)
+        if not self.p:
+            return -1
+        res = self.p.popleft()
+        if self.q[0] == res:
+            self.q.popleft()
         return res
+
+
+# Your MaxQueue object will be instantiated and called as such:
+# obj = MaxQueue()
+# param_1 = obj.max_value()
+# obj.push_back(value)
+# param_3 = obj.pop_front()