[Javascript Data Structures] 队列: 击鼓传花

<script type="text/javascript">   function Queue(){    var j=1;    this.que=function(array,num){      for (var i = 0; i < array.length; ) {        document.write("<br><b>"+"Round:"+(j++)+"</b><br>");          document.write("Joined Persons:"+array+"<br>");          var rt=num%(array.length);          document.write("Eliminate:"+array[rt]+"<br>");          array.splice(rt,1);//新一轮的开始, 都从被淘汰者的下一位, 要重新规定数组的位置          array=array.slice(rt,array.length).concat(array.slice(0,rt));          //开始新一轮          document.write("Remaining:"+array+"<br>");          if (array.length==1) {            document.write("<br>"+"Winner:<b>"+array[0].toUpperCase()+"</b><br>");            break;          };      }           }       }// 参加的人   var array=["1jessica","2krystal","3yoona","4ljy","5seoyon","6GG"];   var queue=new Queue(array);    // 随机的次数   var num=Math.ceil(Math.random()*10+1);   queue.que(array,num);</script>