390 Elimination Game

1 题目

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

2 标准解

2.1 分析

对于数列1~N，对其进行删除操作。第一次删除时，从左向右，隔位删除，第二次删除时，从右向左，隔位删除。重复上述操作，求最后剩下的数字。

这道题用递归来做，用一个bool型变量left，为true表示从左往右，为false表示从右往左。当n为1时返回1。如果n大于1，且是从左往右的话，所有的奇数都被删除，只留下偶数，该问题就变成了2*F(n/2,false)；如果是从右往左的话要分奇偶情况，如果n为奇数，则奇数都被删除，该问题就变成了2*F(n/2,true)；如果n为偶数，数列就变成了1,3,5....n-1，该问题就变成了2*F(n/2,true)-1。

2.2 代码

class Solution {
public:
    int lastRemaining(int n) {
        return find(n,left);        
    }
    int find(int n,bool left){
        if(n == 1) return 1;
        if(left) return 2*find(n/2,false);
        return 2*find(n/2,true)-1+n%2;
    }
};