链表-M-Josephus

package e_link.L_Josephus;


public class Link {
public int iData;
public Link next;
public Link previous;


public Link(int iData) {
this.iData = iData;
}


public void displayLink() {
System.out.print(iData + " ");
}
}package e_link.L_Josephus;


public class LinkList {
Link current;
Link previous;
Link first;
Link last;


public LinkList() {
current = null;
previous = null;
first = null;
last = null;
}


public void insertFirst(int k) {
Link newLink = new Link(k);
if (isEmpty())
last = newLink;
else
first.previous = newLink;
newLink.next = first;
first = newLink;
last.next = first;
}


public void reset() {
current = first;
previous = last;
}


/**
* 下一个节点
*/
public void nextLink() {
previous = current;
current = current.next;
}


/**
* 获取当前节点
* 
* @return
*/
public Link getCurrent() {
return current;
}


/**
* 删除当前节点
* 
* @current 为末尾的话，reset()，否current为删除后一个节点
*/
public int deleteCurrent() {
int temp = current.iData;
previous = current;
current = previous;
return temp;
}


public void displayForward() {
Link current = first;
current.displayLink();
while (current != null) {
current.displayLink();
current = current.next;
}
System.out.println();
}


public boolean isEmpty() {
return first == null;
}
}