cursorlist.java

用循环链表求解约瑟夫(josephus)问题 求解约瑟夫(josephus)问题,用数组实现

public class CursorList{
	private int header;
	static CursorNode[] cursorSpace;
	private static final int SPACE_SIZE=50;
	static {
		cursorSpace=new CursorNode[SPACE_SIZE];
		for(int i=0;i<SPACE_SIZE;i++)
		cursorSpace[i]=new CursorNode(null,i+1);
		cursorSpace[SPACE_SIZE-1].next=0;
	}
	public CursorList(){
		header=alloc();
		cursorSpace[header].next=0;
	}
	private static int alloc(){
		int p=cursorSpace[0].next;
		cursorSpace[0].next=cursorSpace[p].next;
		if(p==0)
		throw new OutOfMemoryError();
		return p;
	}
	private static void free(int p){
		cursorSpace[p].element=null;
		cursorSpace[p].next=cursorSpace[0].next;
		cursorSpace[0].next=p;
	}
}