约瑟夫环问题

package com.strongit;

/**
 * 用数组实现约瑟夫出圈问题，n个人排成一圈，从第一个开始报数，报到m的人出圈，
剩下的人继续开始从1报数，直到所有的人都出圈为止。对于给定的n，m，
求出所有的人出圈顺序
 * @author Administrator
 *
 */
public class TestLink {

	private static final int m = 3; // 

	private static final int n = 6; // 人数 

	public TestLink() {
		Node root = new Node();
		root.data = -1;
		root.next = null;
		create(root,n);
		output(root);
	}

	public void create(Node root,int n) {
		Node tmp = root;
		for(int i=1; i<=n; i++) {
			Node node = new Node();
			node.data = i;
			tmp.next = node;
			tmp = tmp.next;
		}
		root = root.next;
		tmp.next = root;
	}

	public void output(Node root) {
		root = root.next;
		Node pre = null;
		Node tmp = root;
		int pos = 0;
		do {
			pos ++;
			if(pos == m) {
				System.out.print(tmp.data+" , ");
				Node f = tmp;
				if(pre.next == tmp.next) {
					pre.next = null;
					tmp = pre;
				} else {
					pre.next = tmp.next;
					tmp = pre.next;
				}
				f = null;
				pos = 0;
			} else {
				pre = tmp;
				tmp = tmp.next;
			}
		} while(tmp.next != null);
		System.out.println();
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		new TestLink();
	}

}

class Node {
	int data;
	Node next;
}