约瑟夫问题（猴子大王）

import java.util.Iterator;
import java.util.LinkedList;


public class MonkeyKing
{
private LinkedList<Integer> ll;
private int totalNum; //猴子总数
public MonkeyKing()
{
ll=new LinkedList<Integer>();
totalNum=100;
}

public void getKing()
{
for (int i = 1; i <=totalNum; i++) {
ll.add(i);
}
//从第K个开始计数
int k=0;
Iterator it = ll.iterator();
while(totalNum>1)
{
if (it.hasNext()) {
it.next();
k++;
}
else 
{
it=ll.iterator();
}
if (k==14) 
{
k=0;
it.remove();
totalNum--;
}
}
System.out.println("猴子大王是第："+ll.get(0)+" 号");
}
public static void main(String[] args) {
new MonkeyKing().getKing();
}
}