【leetcode】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.

---

思路：
抄作业https://leetcode.com/problems/elimination-game/discuss/?currentPage=1&orderBy=most_votes&query=。很巧妙，只需要修改每次迭代的起始位置head与步长step即可。

---

代码实现：

// 思路：整个过程没有涉及任何删除或移动操作。只需要根据方向和step来计算出下一次head的位置以及所剩元素即可。
class Solution {
public:
    int lastRemaining(int n) {
        bool left = true;
        int remaining = n;
        
        int step = 1;
        int head = 1;
        
        while (remaining > 1){
            if (left || remaining % 2 == 1) head = head + step;
            remaining /= 2;
            step *= 2;
            left = !left;
        }
        
        return head;
    }
};

---

参考：
https://leetcode.com/problems/elimination-game/discuss/87119/JAVA%3A-Easiest-solution-O(logN)-with-explanation