[Jianzhi offer] Jianzhi offer 09 Implementing queues with two stacks

subject
Code
Execution time ：364 ms, In all Python3 Defeated in submission 39.23% Users of
Memory consumption ：19 MB, In all Python3 Defeated in submission 24.23% Users of
Pass the test case ：55 / 55

class CQueue:

    def __init__(self):
        self.stack1=[]
        self.stack2=[]


    def appendTail(self, value: int) -> None:
        self.stack1.append(value)

    def deleteHead(self) -> int:
        if not len(self.stack1) and not len(self.stack2):
            return -1
        else:
            if len(self.stack2):
                temp=self.stack2[-1]
                self.stack2.pop()
                return temp
            else:
                while len(self.stack1):
                    temp=self.stack1[-1]
                    self.stack1.pop()
                    self.stack2.append(temp)
                self.stack2.pop()
                return temp
# Your CQueue object will be instantiated and called as such:
# obj = CQueue()
# obj.appendTail(value)
# param_2 = obj.deleteHead()