public class LinkStack <Item> implements Iterable<Item>{
private Node first;//栈顶
private int N;//元素数量
private Node temp;//遍历对象
public boolean isEmpty(){
return N==0;
}
public int size(){
return N;
}
public void push(Item item){
Node oldFirst=first;
first=new Node();
first.item=item;
first.next=oldFirst;
N++;
}
public Item pop(){
Item item=first.item;
first=first.next;//在没有first的引用,只有second引用
N--;
return item;
}
private class Node{
Item item;
Node next;
}
public Iterator<Item> iterator(){
return new LinkStackIterator();
}
private class LinkStackIterator implements Iterator<Item>{
private int i=N;
@Override
public boolean hasNext() {
return i-->0;
}
@Override
public Item next() {
if(temp==null){
temp=first;
return first.item;
}else{
Item item=temp.next.item;
temp=temp.next;
return item;
}
}
}
}
测试:
public static void main(String[] args) {
LinkStack<String> obj=new LinkStack<>();
obj.push("a");
obj.push("b");
obj.push("c");
Iterator<String> iter=obj.iterator();
while (iter.hasNext()){
String temp=iter.next();
System.out.println(temp);
}
}