// 面试题62:圆圈中最后剩下的数字
// 题目:0, 1, …, n-1这n个数字排成一个圆圈,从数字0开始每次从这个圆圈里
// 删除第m个数字。求出这个圆圈里剩下的最后一个数字。
// ====================方法1====================
static int last_left(uint32_t n, uint32_t m)
{
if(n < 1 || m < 1)
{
return -1;
}
uint32_t i = 0;
std::list<int> numbers;
for(i = 0; i < n; ++ i)
{
numbers.push_back(i);
}
std::list<int>::iterator current = numbers.begin();
while(numbers.size() > 1)
{
for(int i = 1; i < m; ++ i)
{
current ++;
if(current == numbers.end())
current = numbers.begin();
}
auto next = ++ current;
if(next == numbers.end())
next = numbers.begin();
--current;
numbers.erase(current);
current = next;
}
return *(current);
}
// ====================方法2====================
static int last_left2(uint32_t n, uint32_t m)
{
if(n < 1 || m < 1)
return -1;
uint32_t last = 0;
for (uint32_t i = 2; i <= n; i ++)
{
last = (last + m) % i;
}
return static_cast<int>(last);
}