Implement Stack using Queues

https://leetcode.com/problems/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 backpeek/pop from frontsize, 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).

解题思路:

用了俩queue,思路就很明确了。需要peek或者pop的时候,将一个queue中的元素插入另一个queue,直到只剩一个了,这样才能获得尾端的元素。

也可以只用一个queue,但是在push的时候,就将所有元素立刻反向。

崩溃的是,Queue这个interface,居然没有empty()的方法,连size()的方法都没有。

class MyStack {
    LinkedList<Integer> queue1 = new LinkedList<Integer>();
    LinkedList<Integer> queue2 = new LinkedList<Integer>();
    
    // Push element x onto stack.
    public void push(int x) {
        if(queue1.size() > 0) {
            queue1.offer(x);
        } else {
            queue2.offer(x);
        }
    }

    // Removes the element on top of the stack.
    public void pop() {
        if(queue1.size() == 0) {
            LinkedList<Integer> temp = queue1;
            queue1 = queue2;
            queue2 = temp;
        }
        while(queue1.size() > 1) {
            queue2.offer(queue1.poll());
        }
        queue1.poll();
    }

    // Get the top element.
    public int top() {
        if(queue1.size() == 0){
            LinkedList<Integer> temp = queue1;
            queue1 = queue2;
            queue2 = temp;
        }
        while(queue1.size() > 1) {
            queue2.offer(queue1.poll());
        }
        int res = queue1.peek();
        queue2.offer(queue1.poll());
        return res;
    }

    // Return whether the stack is empty.
    public boolean empty() {
        return queue1.size() == 0 && queue2.size() == 0;
    }
}

 

转载于:https://www.cnblogs.com/NickyYe/p/4573541.html

Dataset: Student Records We will implement stack using both array and linked list data structures to store student records. Each student record will have the following information: student name, student ID, and student GPA. 1. Stack using Array: We will use an array to implement stack data structure for storing student records. The array will have a fixed size, and we will use the push, pop, and peek operations to add, remove, and view the top element of the stack, respectively. The Java code for implementing stack using an array is given below: ``` public class StudentRecord { private String name; private int id; private double gpa; public StudentRecord(String name, int id, double gpa) { this.name = name; this.id = id; this.gpa = gpa; } // getters and setters public String toString() { return "Name: " + name + ", ID: " + id + ", GPA: " + gpa; } } public class StudentRecordStack { private StudentRecord[] stack; private int top; private int size; public StudentRecordStack(int size) { stack = new StudentRecord[size]; top = -1; this.size = size; } public void push(StudentRecord record) { if (top == size - 1) { System.out.println("Stack Overflow!"); return; } top++; stack[top] = record; } public StudentRecord pop() { if (top == -1) { System.out.println("Stack Underflow!"); return null; } StudentRecord record = stack[top]; top--; return record; } public StudentRecord peek() { if (top == -1) { System.out.println("Stack Underflow!"); return null; } return stack[top]; } public boolean isEmpty() { return top == -1; } public boolean isFull() { return top == size - 1; } } ``` To test the stack implementation, we can create a few student records and push them onto the stack: ``` public class Main { public static void main(String[] args) { StudentRecordStack stack = new StudentRecordStack(5); StudentRecord record1 = new StudentRecord("John", 1001, 3.5); StudentRecord record2 = new StudentRecord("Jane", 1002, 3.8); StudentRecord record3 = new StudentRecord("Bob", 1003, 3.2); stack.push(record1); stack.push(record2); stack.push(record3); System.out.println(stack.peek()); System.out.println(stack.pop()); System.out.println(stack.pop()); System.out.println(stack.pop()); } } ``` Output: ``` Name: Bob, ID: 1003, GPA: 3.2 Name: Bob, ID: 1003, GPA: 3.2 Name: Jane, ID: 1002, GPA: 3.8 Name: John, ID: 1001, GPA: 3.5 Stack Underflow! ``` 2. Stack using Linked List: We will use a linked list to implement stack data structure for storing student records. The linked list will have a dynamic size, and we will use the push, pop, and peek operations to add, remove, and view the top element of the stack, respectively. The Java code for implementing stack using a linked list is given below: ``` public class StudentRecordNode { private StudentRecord record; private StudentRecordNode next; public StudentRecordNode(StudentRecord record) { this.record = record; this.next = null; } // getters and setters } public class StudentRecordStack { private StudentRecordNode top; public StudentRecordStack() { top = null; } public void push(StudentRecord record) { StudentRecordNode node = new StudentRecordNode(record); node.next = top; top = node; } public StudentRecord pop() { if (top == null) { System.out.println("Stack Underflow!"); return null; } StudentRecord record = top.record; top = top.next; return record; } public StudentRecord peek() { if (top == null) { System.out.println("Stack Underflow!"); return null; } return top.record; } public boolean isEmpty() { return top == null; } } ``` To test the stack implementation, we can create a few student records and push them onto the stack: ``` public class Main { public static void main(String[] args) { StudentRecordStack stack = new StudentRecordStack(); StudentRecord record1 = new StudentRecord("John", 1001, 3.5); StudentRecord record2 = new StudentRecord("Jane", 1002, 3.8); StudentRecord record3 = new StudentRecord("Bob", 1003, 3.2); stack.push(record1); stack.push(record2); stack.push(record3); System.out.println(stack.peek()); System.out.println(stack.pop()); System.out.println(stack.pop()); System.out.println(stack.pop()); } } ``` Output: ``` Name: Bob, ID: 1003, GPA: 3.2 Name: Bob, ID: 1003, GPA: 3.2 Name: Jane, ID: 1002, GPA: 3.8 Name: John, ID: 1001, GPA: 3.5 Stack Underflow! ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值