linkedlistitr.java

来自「用链表实现Josephus问题的源码」· Java 代码 · 共 27 行

package Josephus;

public class LinkedListItr
{
	LinkedListItr(ListNode theNode)
	{
		current = theNode;
	}
	
	public boolean isPastEnd()
	{
		return current == null;
	}
	
	public int retrieve()
	{
		return current.element;
	}
	
	public void advance()
	{
		if(!isPastEnd())
			current = current.next;
	}
	
	ListNode current;
}