双向链表实现栈和队列

最新推荐文章于 2024-08-16 22:08:52 发布

小阿鑫丫

最新推荐文章于 2024-08-16 22:08:52 发布

阅读量1w

点赞数 1

分类专栏：算法文章标签：链表算法 java

本文链接：https://blog.csdn.net/ws13575291650/article/details/113695234

版权

算法专栏收录该内容

10 篇文章 0 订阅

订阅专栏

本文介绍了如何利用双向链表实现栈和队列的数据结构，分别通过头部插入和删除实现栈的O(1)操作，以及队列的头部添加和尾部移除的同样高效策略。通过实例代码展示了如何构造MyStack和MyQueue类来利用这些特性。

摘要由CSDN通过智能技术生成

前言

栈 --》双向链表首部加首部出 O(1)
队列 --》双向链表首部加尾部出 O(1)

1. 双向链表

	public static class Node<T> {
		public T value;
		public Node<T> last;
		public Node<T> next;

		public Node(T data) {
			value = data;
		}
	}

	//双向链表
	public static class DoubleEndsQueue<T> {
		public Node<T> head;
		public Node<T> tail;

		public void addFromHead(T value) {
			Node<T> cur = new Node<T>(value);
			if (head == null) {
				head = cur;
				tail = cur;
			} else {
				cur.next = head;
				head.last = cur;
				head = cur;
			}
		}

		public void addFromBottom(T value) {
			Node<T> cur = new Node<T>(value);
			if (head == null) {
				head = cur;
				tail = cur;
			} else {
				cur.last = tail;
				tail.next = cur;
				tail = cur;
			}
		}

		public T popFromHead() {
			if (head == null) {
				return null;
			}
			Node<T> cur = head;
			if (head == tail) {
				head = null;
				tail = null;
			} else {
				head = head.next;
				cur.next = null;
				head.last = null;
			}
			return cur.value;
		}

		public T popFromBottom() {
			if (head == null) {
				return null;
			}
			Node<T> cur = tail;
			if (head == tail) {
				head = null;
				tail = null;
			} else {
				tail = tail.last;
				tail.next = null;
				cur.last = null;
			}
			return cur.value;
		}

		public boolean isEmpty() {
			return head == null;
		}

	}

2. 栈 --》双向链表首部加首部出 O(1)

public static class MyStack<T> {
		private DoubleEndsQueue<T> queue;

		public MyStack() {
			queue = new DoubleEndsQueue<T>();
		}

		public void push(T value) {
			queue.addFromHead(value);
		}

		public T pop() {
			return queue.popFromHead();
		}

		public boolean isEmpty() {
			return queue.isEmpty();
		}

	}

3. 队列 --》双向链表首部加尾部出 O(1)

public static class MyQueue<T> {
		private DoubleEndsQueue<T> queue;

		public MyQueue() {
			queue = new DoubleEndsQueue<T>();
		}

		public void push(T value) {
			queue.addFromHead(value);
		}

		public T poll() {
			return queue.popFromBottom();
		}

		public boolean isEmpty() {
			return queue.isEmpty();
		}

	}