Leetcode Problem 390. Elimination Game

390. Elimination Game

Leetcode Solutions

Define a recursive function lastRemaining(n) that takes the current size of the array n as its argument.
If n is 1, return 1, as it is the base case with only one element remaining.
For n greater than 1, recursively call lastRemaining(n/2) to simulate the elimination process on the halved array.
After the recursive call, calculate the new head position using the formula 2 * (n/2 + 1 - lastRemaining(n/2)).
Return the calculated head position as the last remaining number.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen