[leetcode] 390 Elimination Game-优快云博客

本文介绍了一个有趣的算法问题：从1到n的有序整数列表开始，交替地从左至右和从右至左移除指定位置的元素，直至只剩下一个数字。文章提供了一个Java实现方案，并附带详细解析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

很开心，自己想出来的一道题

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

public class Solution {
    public int lastRemaining(int n) {
        int start = 1;
        int end = n;
        int duration = 1;
        boolean flag = true;
        while (start < end) {
            int x = (end - start + duration) / duration;
            if (flag) {
                if (x % 2 == 1) {
                    end -= duration;
                } 
                start += duration;
                flag = false;
            } else {
                if (x % 2 == 1) {
                    start += duration;
                }
                end -= duration;
                flag = true;
            }
            duration *= 2;
        }
        return start;
    }
}