Using queue to realize stack

Realize the idea ：

1） Prepare two queues  queue1, queue2（ Queue feature first in first out , Stack features first in and last out ）
2） When entering the stack , Elements are inserted into queue1 in 
3） Out of the stack , Do the following ：
    3.1） If queue2 It's empty , Will queue1 towards queue2 Copy , The last element left returns 
    3.2） If queue2 Not empty , Will queue2 towards queue1 Copy , The last element left returns 

Go straight to the code ：

import java.util.LinkedList;
import java.util.Queue;

/**
 * @ClassName : MyStackWithQueue
 * @Description:  Stack through queue 
 * @Author: liulianglin
 * @Date: 2021/11/17 23:36
 * @Version : 1.0
 *
     Realize the idea ：
        1） Prepare two queues  queue1, queue2（ Queue feature first in first out , Stack features first in and last out ）
        2） When entering the stack , Elements are inserted into queue1 in 
        3） Out of the stack , Do the following ：
            3.1） If queue2 It's empty , Will queue1 towards queue2 Copy , The last element left returns 
            3.2） If queue2 Not empty , Will queue2 towards queue1 Copy , The last element left returns 

 */
public class MyStackWithQueue {
    private Queue<Integer> queue1 = new LinkedList<>();
    private Queue<Integer> queue2 = new LinkedList<>();

    /**
     *  Insert 
     * @return
     */
    private boolean push(int ele){
        return queue1.add(ele);
    }

    private Integer pop(){
        if (queue2.size() == 0){
            // If queue2 It's empty , Will queue1 towards queue2 Copy , The last element left returns 
            while (queue1.size() > 1) {
                queue2.add(this.queue1.poll());
            }
            // Back at this point queue1 Last element of 
            return this.queue1.poll();
        }else{
            // If queue2 Not empty , Will queue2 towards queue1 Copy , The last element left returns 
            while(queue2.size() > 1){
                queue1.add(this.queue2.poll());
            }
            return this.queue2.poll();
        }
    }


    public static void main(String[] args) {
        MyStackWithQueue myStackWithQueue = new MyStackWithQueue();
        myStackWithQueue.push(1);
        myStackWithQueue.push(2);
        myStackWithQueue.push(3);

        System.out.println(myStackWithQueue.pop());
        System.out.println(myStackWithQueue.pop());
        System.out.println(myStackWithQueue.pop());
    }

}