# [数据结构]栈的实现,双向链表与单向链表

I'm Shendi

/**
* 栈.
* @version 1.0
*/
public class 栈<E> {

private static class Node<E> {
E data;
Node<E> next;
public Node (E data, Node<E> next) {
this.next = next;
this.data = data;
}
}

int size = 0;

private Node<E> top;

public E pop() {
if (top == null) return null;
Node<E> node = top;
top = top.next;
size--;
return node.data;
}

public void push(E e) {
if (top == null) top = new Node<E>(e,null);
else {
Node<E> node = new Node<E>(e, top);
top = node;
}
size++;
}

public static void main(String[] args) {
栈<Integer> z = new 栈<>();
z.push(1);
z.push(2);
z.push(3);
for (int i = 0;i < 3;i++) {
System.out.println(z.pop());
}
for (int i = 0;i < 3;i++) {
System.out.println(z.pop());
}
}

}


/**
* 栈.
* @version 1.0
*/
public class 栈<E> {

private static class Node<E> {
Node<E> prev;
E data;
Node<E> next;
public Node (Node<E> prev, E data, Node<E> next) {
this.prev = prev;
this.next = next;
this.data = data;
}
}

int size = 0;

private Node<E> top;

public E pop() {
if (top == null) return null;
Node<E> node = top;
top = top.next;
size--;
return node.data;
}

public void push(E e) {
if (top == null) top = new Node<E>(null,e,null);
else {
top.prev = new Node<E>(null, e, top);
top = top.prev;
}
size++;
}

public static void main(String[] args) {
栈<Integer> z = new 栈<>();
z.push(1);
z.push(2);
z.push(3);
for (int i = 0;i < 3;i++) {
System.out.println(z.pop());
}
for (int i = 0;i < 3;i++) {
System.out.println(z.pop());
}
}

}

06-04

06-05 2961

07-07 2727

12-09 1104

07-09 2581

01-26 158

01-08 43

#### 数据结构——栈的java实现(二)-使用单向链表以及实现

©️2020 CSDN 皮肤主题: 数字20 设计师: CSDN官方博客

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