使用链表实现栈

使用链表实现栈

  1. 根据链表的性质,对头结点的操作的时间复杂度为O(1),可以很自然的想到链表是作为栈实现的非常好的底层数据结构。因为栈就是对栈顶进行操作的一种抽象数据结构
  2. 具体实现代码

LinkedList类

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
package LinkedList.LinkedListStack;

/**
* @ Description:带虚拟节点的链表
* @ Date: Created in 13:23 12/07/2018
* @ Author: Anthony_Duan
*/
public class LinkedList<E> {

private class Node {

public E e;

public Node next;

public Node(E e, Node next) {
this.e = e;
this.next = next;
}

public Node() {
this(null, null);
}


@Override
public String toString() {
return e.toString();
}
}


private Node dummyHead;
private int size;

public LinkedList() {
dummyHead = new Node();
size = 0;
}

public int getSize() {
return size;
}

public boolean isEmpty() {
return size == 0;
}

public void add(int index, E e) {
if (index < 0 || index > size) {
throw new IllegalArgumentException("Add failed. Illegal index.");
}
Node prev = dummyHead;
for (int i = 0; i < index; i++) {
prev = prev.next;
}
prev.next = new Node(e, prev.next);
size++;
}

public void addFirst(E e) {
add(0, e);
}

public void addLast(E e) {
add(size, e);
}


public E get(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("Get failed. Illegal index.");
}
Node cur = dummyHead.next;
for (int i = 0; i < index; i++) {
cur = cur.next;
}
return cur.e;
}

public E getFirst() {
return get(0);
}

public E getLast() {
return get(size);
}

public void set(int index, E e) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("Set failed. Illegal index.");
}
Node cur = dummyHead.next;
for (int i = 0; i < index; i++) {
cur = cur.next;
}
cur.e = e;
}


public boolean contains(E e) {
Node cur = dummyHead.next;
while (cur != null) {
if (cur.e.equals(e)) {
return true;
}
cur = cur.next;
}
return false;
}

public E remove(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("Remove failed. Index is illegal.");
}
Node prev = dummyHead;
for (int i = 0; i < index; i++) {
prev = prev.next;
}

Node retNode = prev.next;
prev.next = retNode.next;
retNode.next = null;
size--;
return retNode.e;
}


public E removeFirst() {
return remove(0);
}

public E removeLast() {
return remove(size - 1);
}

public void removeElement(E e) {
Node prev = dummyHead;
while (prev.next != null) {
if (prev.next.e.equals(e)) {
break;
}
prev = prev.next;
}

if (prev.next != null) {
Node delNode = prev.next;
prev.next = delNode.next;
delNode.next = null;
size--;
}


}

@Override
public String toString() {
StringBuilder res = new StringBuilder();

Node cur = dummyHead.next;
while (cur != null) {
res.append(cur + "->");
cur = cur.next;
}
res.append("NULL");

return res.toString();
}

}

LinkedListStack类

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package LinkedList.LinkedListStack;

/**
* @ Description: 使用链表实现栈
* @ Date: Created in 13:56 12/07/2018
* @ Author: Anthony_Duan
*/
public class LinkedListStack<E> implements Stack<E> {

private LinkedList<E> list;

public LinkedListStack() {
list = new LinkedList<E>();
}


@Override
public int getSize() {
return list.getSize();
}

@Override
public boolean isEmpty() {
return list.isEmpty();
}

@Override
public void push(E e) {
list.addFirst(e);
}

@Override
public E pop() {
return list.removeFirst();
}

@Override
public E peek() {
return list.getFirst();
}

@Override
public String toString() {
StringBuilder res = new StringBuilder();
res.append("Stack: top ");
res.append(list);
return res.toString();
}


public static void main(String[] args) {

LinkedListStack<Integer> stack = new LinkedListStack<Integer>();

for (int i = 0; i < 5; i++) {
stack.push(i);
System.out.println(stack);
}

stack.pop();
System.out.println(stack);
}
}

-------------End Of This ArticleThank You For Reading-------------