请你仅使用两个队列实现一个后入先出（LIFO）的栈，并支持普通队列的全部四种操作（push、top、pop 和 empty）。 实现 MyStack 类： void push(int x) 将元素

class MyStack {
Queue qu1 = new LinkedList<>();
Queue qu2 = new LinkedList<>();
/** Initialize your data structure here. */
public MyStack() {

}

/** Push element x onto stack. */
public void push(int x) {
    if(!qu1.isEmpty()){
        qu1.offer(x);
    }else if(!qu2.isEmpty()){
        qu2.offer(x);
    }else{
        qu1.offer(x);
    }
}

/** Removes the element on top of the stack and returns that element. */
public int pop() {
    if(empty()){
        return -1;
    }
    if(qu1.isEmpty()){
        int size = qu2.size();
        for(int i = 0;i<size-1;i++){
            qu1.offer (qu2.poll());
        }
        return qu2.poll();
    }else{    
       int size = qu1.size();       
        for(int i = 0;i<size-1;i++){
            qu2.offer (qu1.poll());
        }
        return qu1.poll();
    }
}

/** Get the top element. */
public int top() {
    if(empty()){
        return -1;
    }
    if(qu1.isEmpty()){
       int size = qu2.size();
       int cur = 0;
        for(int i = 0;i<size;i++){
             cur = qu2.poll();
            qu1.offer(cur);
        }
        return cur;
    }else{
      int size = qu1.size();
      int cur = 0;
        for(int i = 0;i<size;i++){
            cur = qu1.poll();
            qu2.offer(cur);
        }
        return cur;
    }
}

/** Returns whether the stack is empty. */
public boolean empty() {
    return (qu1.isEmpty()&&qu2.isEmpty());
}

}