## New coder, Step further

winter is coming...

# 390. Elimination Game

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;
}

#### Leetcode 390. Elimination Game 消除游戏 解题报告

2016-09-30 22:20:56

#### LeetCode—390. Elimination Game

2016-09-18 12:06:55

#### 【LeetCode】390. Elimination Game

2016-12-11 11:23:38

#### leetcode 390. Elimination Game

2017-06-22 23:47:15

#### LeetCode 390. Elimination Game

2017-04-12 18:17:36

#### 算法实战1：爱消除（Elimination Game）

2013-10-17 21:37:31

#### Elimination Game

2016-10-01 12:18:49

#### 【LeetCode】390. Elimination Game 解题报告（Python）

2018-03-12 14:41:22

#### 390. Elimination Game

2017-02-17 21:50:09

#### [leetcode] 390. Elimination Game

2017-05-05 10:27:01