• ㊗️
• 大家
• offer
• 多多！

## Problem

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



## Code

• 1,2,3,4,5,6,7,8,9,10,11,12,13,14 - head, step, remain,
• 1,2,3,4,5,6,7,8,9,10,11,12,13,14 - 1,1,14
• ,2, ,4, ,6, ,8, ,10, ,12, ,14 - 2,2,7 ->
• , , ,4, , , ,8, , , ,12, , - 4,4,3 <-
• , , , , , , ,8, , , , , , - 8,8,1 ->

• 1,2,3,4,5,6,7,8,9,10,11,12,13 - head, step, remain,
• 1,2,3,4,5,6,7,8,9,10,11,12,13 - 1,1,13
• ,2, ,4, ,6, ,8, ,10, ,12, - 2,2,6 ->
• ,2, , , ,6, , , ,10, , , - 2,4,3 <-
• , , , , ,6, , , , , , , - 6,8,1 ->

• 从左删除的时候: 每次都要让 head + step
• 从右删除的时候:
• 如果剩下奇数个数字, head + step, 比如 2, 4, 6
• 如果剩下偶数个数字, head 不变, 比如 2, 4, 6, 8

class Solution {
public int lastRemaining(int n) {
int remain = n;
int step = 1;
boolean isLeft = true;

while(remain != 1){
// 从left || 从right, 但有奇数个元素
if(isLeft || (!isLeft && remain % 2 == 1)){