Implement Stack using Queues



题目描述：Implement the following operations of a stack using queues.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.
• empty() -- Return whether the stack is empty.

Notes:

• You must use only standard operations of a queue -- which means only push to back, peek/pop from front, size, and is empty operations are valid.
• Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
• You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).

解题思路：采用两个队列实现栈的操作，重点保证栈的先进后出的特性。

Java实现：

class MyStack {
    // Push element x onto stack.
	    Queue<Integer> queue1=new LinkedList<Integer>();
	    Queue<Integer> queue2=new LinkedList<Integer>();
	    public void push(int x) {	    	
	        while(!queue2.isEmpty()){
	            queue1.add(queue2.poll());	            
	        }	        
	        queue1.add(x);
	    }

	    // Removes the element on top of the stack.
	    public void pop() {
	        while(!queue2.isEmpty()){
	            queue1.add(queue2.poll());
	        }
	        while(queue1.size()>1){
	            queue2.add(queue1.poll());
	        }
	        if(queue1.size()==1) queue1.poll();
	    }

	    // Get the top element.
	    public int top() {
	        while(!queue2.isEmpty()){
	            queue1.add(queue2.poll());
	        }
	        while(queue1.size()>1){
	            queue2.add(queue1.poll());
	        }
	        if(queue1.size()==1) {
	          int num=queue1.poll();
	          queue2.add(num);
	          return num;
	        } 
	        else return 0;
	    }

	    // Return whether the stack is empty.
	    public boolean empty() {
	        if(queue1.isEmpty()&&queue2.isEmpty()) return true;
	        else return false;
	    }
}

原题地址： https://leetcode.com/problems/implement-stack-using-queues/

版权声明：本文为博主原创文章，未经博主允许不得转载。