Leetcode Problem 390. Elimination Game

390. Elimination Game

Leetcode Solutions

Mathematical Approach with Recursion

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

Iterative Simulation with Queue

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...