package com.algs;
import java.util.Iterator;
public class StackLinkedList- implements Iterable
- {
private Node first;
private int N;
private class Node
{
Item item;
Node next;
}
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;
N--;
return item;
}
public Iterator
- iterator()
{
return new ReverseArrayIterator();
}
public class ReverseArrayIterator implements Iterator
-
{
private int i = N;
public boolean hasNext()
{
return i > 0;
}
@SuppressWarnings("unchecked")
public Item next(){
return (Item) first.next;
}
public void remove(){
}
}
}