We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 55100e4 commit 7198914Copy full SHA for 7198914
1 file changed
Target Offer/用两个栈实现队列.py
@@ -15,9 +15,7 @@ def pop(self):
15
elif len(self.stack2) == 0:
16
while len(self.stack1) > 0:
17
self.stack2.append(self.stack1.pop())
18
- return self.stack2.pop()
19
- else:
20
+ return self.stack2.pop()
21
22
P = Solution()
23
P.push(10)
0 commit comments