码迷,mamicode.com
首页 > 其他好文 > 详细

猴子选大王

时间:2015-01-09 20:53:57      阅读:187      评论:0      收藏:0      [点我收藏+]

标签:

实现一:

--[[LUA]]

-- 猴子选大王:n只猴子围成一圈,报数到m的猴子淘汰,最后剩一只猴子则为大王。
local n, m, idx = 12, 3, 0
local list = {"1","2","3","4","5","6","7","8","9","10","11","12",}
while(n > 1) do
idx = (idx + m) % (#list) == 0 and #list or ((idx + m) % (#list))
table.remove(list, idx)
idx = idx > #list and 0 or (idx - 1)
n = n - 1
end
print(" >>>>>>>>> ", list[1])

 

猴子选大王

标签:

原文地址:http://www.cnblogs.com/yyxt/p/4214133.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!