FPEvalRepoPublic/LeetCodeMetaData
0399
1{2 "id": 2386,3 "name": "min-max-game",4 "difficulty": "Easy",5 "link": "https://leetcode.com/problems/min-max-game/",6 "date": "2022-05-29",7 "task_description": "You are given a **0-indexed** integer array `nums` whose length is a power of `2`. Apply the following algorithm on `nums`: Let `n` be the length of `nums`. If `n == 1`, **end** the process. Otherwise, **create** a new **0-indexed** integer array `newNums` of length `n / 2`. For every **even** index `i` where `0 <= i < n / 2`, **assign** the value of `newNums[i]` as `min(nums[2 * i], nums[2 * i + 1])`. For every **odd** index `i` where `0 <= i < n / 2`, **assign** the value of `newNums[i]` as `max(nums[2 * i], nums[2 * i + 1])`. **Replace** the array `nums` with `newNums`. **Repeat** the entire process starting from step 1. 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] <= 109` `nums.length` is a power of `2`.",8 "test_case": [9 {10 "label": "Example 1",11 "input": "nums = [1,3,5,2,4,8,2,2]",12 "output": "1 "13 },14 {15 "label": "Example 2",16 "input": "nums = [3]",17 "output": "3 "18 }19 ],20 "constraints": [21 "1 <= nums.length <= 1024",22 "1 <= nums[i] <= 109",23 "nums.length is a power of 2."24 ],25 "python_template": "class Solution(object):\n def minMaxGame(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ",26 "java_template": "class Solution {\n public int minMaxGame(int[] nums) {\n \n }\n}",27 "metadata": {28 "func_name": "minMaxGame"29 }30}