建立循环链表，实现选猴王的程序：输入N只猴子，从第一只猴子开始报数（M),数到m的那只猴子就推出，如此循环，剩下的最后一直猴子就是猴王...

代码说明：

建立循环链表，实现选猴王的程序：输入N只猴子，从第一只猴子开始报数（M),数到m的那只猴子就推出，如此循环，剩下的最后一直猴子就是猴王-Circulation list set up, implementation procedures for the election of the King: Enter the N monkeys, monkeys from the first start off (M), only a few of the m Monkey on the introduction of such a cycle has been the last remaining Monkey is a monkey Wang! !