You are given an integer array nums.
Two players, Alice and Bob, play a game in turns, with Alice playing first.
nums[l..r] such that r - l + 1 < m, where m is the current length of the array.Alice aims to maximize the final element, while Bob aims to minimize it. Assuming both play optimally, return the value of the final remaining element.
Example 1:
Input: nums = [1,5,2]
Output: 2
Explanation:
One valid optimal strategy:
[1], array becomes [5, 2].[5], array becomes [2]. Thus, the answer is 2.Example 2:
Input: nums = [3,7]
Output: 7
Explanation:
Alice removes [3], leaving the array [7]. Since Bob cannot play a turn now, the answer is 7.
Constraints:
1 <= nums.length <= 1051 <= nums[i] <= 105Solutions for this problem are being prepared.
Try solving it yourselfPractice Final Element After Subarray Deletions with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor