Skip to content

Commit d6b72d1

Browse files
Merge pull request youngyangyang04#696 from GHumorBS/patch-1
Update 0232.用栈实现队列.md
2 parents aefaa02 + 55753bb commit d6b72d1

File tree

1 file changed

+8
-15
lines changed

1 file changed

+8
-15
lines changed

problems/0232.用栈实现队列.md

Lines changed: 8 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -205,33 +205,26 @@ class MyQueue:
205205

206206
def pop(self) -> int:
207207
"""
208-
1. 检查如果out里面元素,则直接pop
209-
2. 如果out没有元素,就把in里面的元素(除了第一个)依次pop后装进out里面
210-
3. 直接把in剩下的元素pop出来,就是queue头部的
208+
Removes the element from in front of queue and returns that element.
211209
"""
212-
if self.empty:
210+
if self.empty():
213211
return None
214212

215213
if self.stack_out:
216214
return self.stack_out.pop()
217215
else:
218-
for i in range(1, len(self.stack_in)):
216+
for i in range(len(self.stack_in)):
219217
self.stack_out.append(self.stack_in.pop())
220-
return self.stack_in.pop()
218+
return self.stack_out.pop()
221219

222220

223221
def peek(self) -> int:
224222
"""
225-
1. 查out有没有元素,有就把最上面的返回
226-
2. 如果out没有元素,就把in最下面的返回
223+
Get the front element.
227224
"""
228-
if self.empty:
229-
return None
230-
231-
if self.stack_out:
232-
return self.stack_out[-1]
233-
else:
234-
return self.stack_in[0]
225+
ans = self.pop()
226+
self.stack_out.append(ans)
227+
return ans
235228

236229

237230
def empty(self) -> bool:

0 commit comments

Comments
 (0)