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

使用递归的思路参考博客http://blog.csdn.net/u011934885/article/details/52349484

class Solution {
public:
    int lastRemaining(int n) {
        return recurLeft2Right(n);
    }
    int recurLeft2Right(int n){
        if(n == 1) return 1;
        if(n == 2) return 2;
        if(n & 1)
            return 2 * recurRight2Left((n - 1) >> 1);
        else 
            return 2 * recurRight2Left(n >> 1);
    }
    int recurRight2Left(int n){
        if(n == 1) return 1;
        if(n == 2) return 1;
        if(n & 1)
            return 2 * recurLeft2Right(n / 2);
        else
            return 2 * recurLeft2Right(n / 2) - 1;
    }
};