在看javaScript数据结构与算法这本书时，看到一个挺有意思的题目--击鼓传花

在这个游戏中，孩子们围成一个圆圈，把花尽快地传递给旁边的人。某一时刻传花停止， 这个时候花在谁手里，谁就退出圆圈结束游戏。重复这个过程，直到只剩一个孩子（胜者）。

书上给出了循环队列的解决方案

function Queue() {var items = [];this.enqueue = function(element){items.push(element);};this.dequeue = function(){return items.shift();};this.front = function(){return items[0];};this.isEmpty = function(){return items.length == 0;};this.clear = function(){items = [];};this.size = function(){return items.length;};this.print = function(){console.log(items.toString());};
}
function hotPotato (nameList, num){var queue = new Queue(); // {1}for (var i=0; i<nameList.length; i++){queue.enqueue(nameList[i]); // {2}}var eliminated = '';while (queue.size() > 1){for (var i=0; i<num; i++){queue.enqueue(queue.dequeue()); // {3}}eliminated = queue.dequeue();// {4}console.log(eliminated + '在击鼓传花游戏中被淘汰。');}return queue.dequeue();// {5}
}
var names = ['John','Jack','Camila','Ingrid','Carl'];
var winner = hotPotato(names, 7);
console.log('胜利者：' + winner);

我想到的是链表，感觉更符合场景需求

/*** Created by ** on 2017/12/14.*/
function LinkedList() {var Node = function(element){ // {1}this.element = element;this.next = null;};var length = 0; // {2}var head = null; // {3}this.append = function(element){var node = new Node(element), //{1}current; //{2}if (head === null){ //列表中第一个节点 //{3}head = node;} else {current = head; //{4}//循环列表，直到找到最后一项while(current.next){current = current.next;}//找到最后一项，将其next赋为node，建立链接current.next = node; //{5}}length++; //更新列表的长度 //{6}};this.insert = function(position, element){//检查越界值if (position >= 0 && position <= length){ //{1}var node = new Node(element),current = head,previous,index = 0;if (position === 0){ //在第一个位置添加node.next = current; //{2}head = node;} else {while (index++ < position){ //{3}previous = current;current = current.next;}node.next = current; //{4}previous.next = node; //{5}}length++; //更新列表的长度return true;} else {return false; //{6}}};this.removeAt = function(position){//检查越界值if (position > -1 && position < length){ // {1}var current = head, // {2}previous, // {3}index = 0; // {4}//移除第一项if (position === 0){ // {5}head = current.next;} else {while (index++ < position){ // {6}previous = current; // {7}current = current.next; // {8}}//将previous与current的下一项链接起来：跳过current，从而移除它previous.next = current.next; // {9}}length--; // {10}return current.element;} else {return null; // {11}}};this.remove = function(element){var index = this.indexOf(element);return this.removeAt(index);};this.indexOf = function(element){var current = head, //{1}index = -1;while (current) { //{2}if (element === current.element) {return index; //{3}}index++; //{4}current = current.next; //{5}}return -1;};this.isEmpty = function() {return length === 0;};this.size = function() {return length;};this.toString = function(){var current = head, //{1}string = ''; //{2}while (current) { //{3}string = current.element; //{4}current = current.next; //{5}}return string; //{6}};// this.print = function(){};this.getHead = function(){return head;};this.setHead = function(element){head = element;};/*** 创建循环链表*/this.creatTail = function(){var current = head; //{4}//循环列表，直到找到最后一项while(current.next){current = current.next;}//找到最后一项，将其next赋为head，建立循环链接current.next = head; //{5}}/*** 循环链表删除方法* @param position* @returns {null}*/this.removeAt_tail = function(position){//检查越界值if (position > -1 && length > 1){ // {1}var current = head, // {2}previous, // {3}index = 0; // {4}//如果移除数大于链表长度，会循环找数，直接取取余if(position > length){position = position%length;}//移除第一项if (position === 0){ // {5}head = current.next;} else {while (index++ < position){ // {6}previous = current; // {7}current = current.next; // {8}}//将previous与current的下一项链接起来,取消引用current，从而移除它previous.next = current.next; // {9}this.setHead(previous.next);//重新设置head}length--; // {10}return current.element;} else {return null; // {11}}};
}function hotPotato (nameList, num){var list = new LinkedList();for (var i=0; i<nameList.length; i++){list.append(nameList[i]);}list.creatTail();var eliminated = '';while (list.size() > 1){eliminated = list.removeAt_tail(num);console.log(eliminated + '在击鼓传花游戏中被淘汰。');}return list.getHead();// {5}
}var names = [];
for(var i = 0;i<100;i++){names.push(i);
}var winner = hotPotato(names, 7);
console.log('胜利者：' + winner.element);