删除 双栈模拟队列

双栈模拟队列

-import java.util.Scanner;
-import java.util.Stack;
-
-public class StackInsteadOfQueue {
-    static int n1;//第一个栈的大小
-    static int n2;//第二个栈的大小
-    static Stack<Integer> s1 = new Stack<Integer>();//用作输入
-    static Stack<Integer> s2 = new Stack<Integer>();//用作输出
-    public static void main(String[] args) {
-        Scanner in = new Scanner(System.in);
-        int x = in.nextInt();
-        int y = in.nextInt();
-        n1 = Math.min(x, y);//短的放输入
-        n2 = Math.max(x, y);//长的放输出
-        while(true){
-            String c = in.next();
-            if(c.equals("A")){
-                int n = in.nextInt();
-                if(s1.size() == n1){//当栈1满时执行判断移动操作
-                    if(s2.empty()){//如果s2为空，把s1所有元素移到s2，再加入元素
-                        move();    //把s1全部移到s2
-                        s1.push(n);
-                    }else{
-                        System.out.println("ERROR:Full");//如果s2不为空，栈满
-                    }
-                }else{
-                    s1.push(n);
-                }
-            }else if(c.equals("D")){
-                if(!s2.empty()){
-                    System.out.println(s2.pop());
-                }else if(!s1.empty() && s2.empty()){//s2为空后，把s1所有元素移到s2，再输出
-                    move();
-                    System.out.println(s2.pop());
-                }else if(s1.empty() && s2.empty()){//s1和s2都空，则栈为空
-                    System.out.println("ERROR:Empty");
-                }
-            }
-            if(c.equals("T")) break;
-        }
-
-    }
-    //把s1全部移到s2
-    private static void move() {
-        while(!s1.empty()){//只要不空便一直移动
-            s2.push(s1.pop());
-        }
-    }
-}
\ No newline at end of file