# 390. Elimination Game

1220人阅读 评论(2)

There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach the end of the list.

Repeat the previous step again, but this time from right to left, remove the right most number and every other number from the remaining numbers.

We keep repeating the steps again, alternating left to right and right to left, until a single number remains.

Find the last number that remains starting with a list of length n.

Example:

Input:
n = 9,
1 2 3 4 5 6 7 8 9
2 4 6 8
2 6
6

Output:
6

class Solution {
public:
int lastRemaining(int n) {
return f(n);
}
int f (int n) { //从左往右
if (n == 1) return 1;
if (n == 2) return 2;
if (n & 1 == 1) {
return 2*g((n-1)/2);
}
else {
return 2*g(n/2);
}
}
int g (int n) { //从右往左
if (n == 1) return 1;
if (n == 2) return 1;
if (n & 1 == 1) {
return 2*f((n-1)/2);
}
else {
return 2*f(n/2)-1;
}
}
};

int lastRemaining(int n) {
int base = 1, first = 1, last = n;
bool check_first = false;
while (first < last) { //remaining number is first, first + base, ..., last
base *= 2;
check_first = !check_first;
int r = (check_first?first:last) % base;
if (first % base == r) first += base/2;
if (last % base == r) last -= base/2;
}
return first;
}

1
0

个人资料
• 访问：26327次
• 积分：1779
• 等级：
• 排名：千里之外
• 原创：148篇
• 转载：4篇
• 译文：1篇
• 评论：2条
文章分类
阅读排行
最新评论