约瑟夫环（循环链表）

import java.util.*;
public class Josephus {

    public static void main(String[] args) {
        if(args.length<2){
            System.out.println("Input N and M.");
            return;
        }
        int n = Integer.parseInt(args[0]);
        int m = Integer.parseInt(args[1]);
        int point=0,number=1;
        List<Integer> list = new ArrayList<Integer>();
        for(int i=1;i<=n; i++){
            //初始化链表
            list.add(i);
        }

        while(list.size()>1){
            if(number%m==0){
                list.remove(point);
                --point;
            }
            ++point;//指针后移
            ++number;
            if(point>list.size()-1){
                //指针越界重新开始
                point=0;
            }
        }
       

        System.out.println(list.get(0));
       
    }
}

http://www.blogjava.net/hellboys/archive/2006/06/07/51222.aspx