perf: eliminate redundant judgments (doocs#652)

Author: YangFong

lcof/面试题09. 用两个栈实现队列/README.md

@@ -48,8 +48,6 @@ class CQueue:
 
     def appendTail(self, value: int) -> None:
         self.s1.append(value)
-        if not self.s2:
-            self._move()
 
     def deleteHead(self) -> int:
         if not self.s2:
@@ -82,9 +80,6 @@ class CQueue {
 
     public void appendTail(int value) {
         s1.push(value);
-        if (s2.isEmpty()) {
-            move();
-        }
     }
 
     public int deleteHead() {
@@ -225,9 +220,6 @@ class CQueue {
 
     appendTail(value: number): void {
         this.stack1.push(value);
-        if (this.stack2.length == 0) {
-            this.move();
-        }
     }
 
     move(): void {

lcof/面试题09. 用两个栈实现队列/Solution.java

@@ -6,14 +6,11 @@ public CQueue() {
         s1 = new ArrayDeque<>();
         s2 = new ArrayDeque<>();
     }
-    
+
     public void appendTail(int value) {
         s1.push(value);
-        if (s2.isEmpty()) {
-            move();
-        }
     }
-    
+
     public int deleteHead() {
         if (s2.isEmpty()) {
             move();
@@ -33,4 +30,4 @@ private void move() {
  * CQueue obj = new CQueue();
  * obj.appendTail(value);
  * int param_2 = obj.deleteHead();
- */
+ */

lcof/面试题09. 用两个栈实现队列/Solution.py

@@ -6,8 +6,6 @@ def __init__(self):
 
     def appendTail(self, value: int) -> None:
         self.s1.append(value)
-        if not self.s2:
-            self._move()
 
     def deleteHead(self) -> int:
         if not self.s2:
@@ -23,4 +21,4 @@ def _move(self):
 # Your CQueue object will be instantiated and called as such:
 # obj = CQueue()
 # obj.appendTail(value)
-# param_2 = obj.deleteHead()
+# param_2 = obj.deleteHead()

lcof/面试题09. 用两个栈实现队列/Solution.ts

@@ -8,9 +8,6 @@ class CQueue {
 
     appendTail(value: number): void {
         this.stack1.push(value);
-        if (this.stack2.length == 0) {
-            this.move();
-        }
     }
 
     move(): void {