easyArraySimulation 0 views
Min Max Game
You are given a 0-indexed integer array nums whose length is a power of 2.
You are given a 0-indexed integer array nums whose length is a power of 2.
Apply the following algorithm on nums:
Return the last number that remains in nums after applying the algorithm.
Example 1
Input: nums = [1,3,5,2,4,8,2,2]
Output: 1
Explanation: The following arrays are the results of applying the algorithm repeatedly. First: nums = [1,5,4,2] Second: nums = [1,4] Third: nums = [1] 1 is the last remaining number, so we return 1.
Example 2
Input: nums = [3]
Output: 3
Explanation: 3 is already the last remaining number, so we return 3.
Constraints
- 1 <= nums.length <= 1024
- 1 <= nums[i] <= 10^9
- nums.length is a power of 2.
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.