import java.util.Stack;
public class partition {
public Stack {
Node top;
Object pop() {
if (top != null) {
Object item = top.data;
top = top.next;
return item;
}
return null;
}
Object push(Object item) {
Node t= new Node(item);
t.next = top;
top = t;
}
Object peek() {
return top.data;
}
}
public Queue {
Node first, last;
void enqueu(Object item) {
if(first == null) {
last = new Node(item);
first = last;
}
else {
last.next = new Node(item);
last = last.next;
}
}
Object dequeue() {
if(first != null) {
Object.item = first.data;
first = first.next;
return item
}
return null;
}
}
}
【Java】栈和队列的java实现
最新推荐文章于 2024-03-23 09:55:11 发布