From 55753bb5580e9a25a6af1e9cc10834156bf149b7 Mon Sep 17 00:00:00 2001
From: Asterisk <44215173+GHumorBS@users.noreply.github.com>
Date: Tue, 31 Aug 2021 14:30:39 +0800
Subject: [PATCH] =?UTF-8?q?Update=200232.=E7=94=A8=E6=A0=88=E5=AE=9E?=
 =?UTF-8?q?=E7=8E=B0=E9=98=9F=E5=88=97.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Python 更新：
1. 更新前版本的self.pop()语法错误
2. 更新后C++范例逻辑趋于统一
---
 problems/0232.用栈实现队列.md | 23 ++++++++---------------
 1 file changed, 8 insertions(+), 15 deletions(-)

diff --git a/problems/0232.用栈实现队列.md b/problems/0232.用栈实现队列.md
index a4a73603..9f6bb90f 100644
--- a/problems/0232.用栈实现队列.md
+++ b/problems/0232.用栈实现队列.md
@@ -205,33 +205,26 @@ class MyQueue:
 
     def pop(self) -> int:
         """
-        1. 检查如果out里面元素，则直接pop
-        2. 如果out没有元素，就把in里面的元素（除了第一个）依次pop后装进out里面
-        3. 直接把in剩下的元素pop出来，就是queue头部的
+        Removes the element from in front of queue and returns that element.
         """
-        if self.empty:
+        if self.empty():
             return None
         
         if self.stack_out:
             return self.stack_out.pop()
         else:
-            for i in range(1, len(self.stack_in)):
+            for i in range(len(self.stack_in)):
                 self.stack_out.append(self.stack_in.pop())
-            return self.stack_in.pop()
+            return self.stack_out.pop()
 
 
     def peek(self) -> int:
         """
-        1. 查out有没有元素，有就把最上面的返回
-        2. 如果out没有元素，就把in最下面的返回
+        Get the front element.
         """
-        if self.empty:
-            return None
-        
-        if self.stack_out:
-            return self.stack_out[-1]
-        else:
-            return self.stack_in[0]
+        ans = self.pop()
+        self.stack_out.append(ans)
+        return ans
 
 
     def empty(self) -> bool: