Rust - Brutal Force
Solution - github\n\nProblem List\n#Array - github\n\n\n/// @author: Leon\n/// https://leetcode.com/problems/min-max-game/\n/// Time Complexity:    O(lg(`_len_n
Solution - [github](https://github.com/An7One/lc_soln_rust_leon/tree/main/src/leetcode/lvl1/lc2293)\n\n<b>Problem List</b>\n#Array - [github](https://github.com/An7One/leetcode-problems-by-tag-an7one/tree/main/txt/by_data_structure/array)\n\n```\n/// @author: Leon\n/// https://leetcode.com/problems/min-max-game/\n/// Time Complexity:    O(lg(`_len_n`))\n/// Space Complexity:   O(`_len_n`)\nimpl Solution {\n    pub fn min_max_game(nums: Vec<i32>) -> i32 {\n        let mut nums = nums;\n        while nums.len() > 1{\n            let len_n: usize = nums.len();\n            let mut res: Vec<i32> = vec![];\n            for idx in 0..len_n / 2{\n                if idx % 2 == 0{\n                    res.push(std::cmp::min(nums[2 * idx], nums[2 * idx + 1]));\n                }else{\n                    res.push(std::cmp::max(nums[2 * idx], nums[2 * idx + 1]));\n                }\n            }\n            nums = res;\n        }\n        nums[0]\n    }\n}\n```
['Rust']