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) {
        int first = 1;
        int index = 2, last = index;
        int remain = n;
        boolean tag = false;
        int val = 1;
        while (remain > 1){
            /*
            for (int i = 1 + first; i <= n; i += index){
                val = i;
            }
            */
            val = 1 + first;
            last = index;
            index = (index << 1);
            remain = (remain >> 1);
            tag = !tag;
            if (!tag||(remain%2) != 0){
                first = first + last;
            }
            /*
            if (tag){
                if ((remain%2) != 0){
                    first = first + last;
                }
            }
            else {
                first = first + last;
            }
            */
        }
        return val;
    }
}