JavaCodeTra 猴子选猴王 约瑟夫循环

之前用的是循环链表，java刚学，不知道怎么用链表。用个小算法吧

代码：

import java.util.Scanner;

/**
 * 
 */

/**
 * @author john
 * @约瑟夫循环/MonkeyKing
 */
public class MonkeyKing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		System.out.print("请输入m。n：");
		Scanner scanner = new Scanner (System.in);
		int m =scanner.nextInt() ;
		int n =scanner.nextInt() ;
		System.out.print("第"+findKing(m,n)+"仅仅猴子为猴王");
	}

	public static int findKing(int m, int n) {
		int MonkyKingIndex = 0;
		for (int i = 2; i <= m; ++i) {
			MonkyKingIndex = (MonkyKingIndex + n) % i; 
		}
		return MonkyKingIndex+1;
	}

}