Elimination Game问题及解法
来源:互联网 发布:淘宝上买的轮毂可靠吗 编辑:程序博客网 时间:2024/06/01 07:36
问题描述:
There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach the end of the list.
Repeat the previous step again, but this time from right to left, remove the right most number and every other number from the remaining numbers.
We keep repeating the steps again, alternating left to right and right to left, until a single number remains.
Find the last number that remains starting with a list of length n.
示例:
Input:n = 9,1 2 3 4 5 6 7 8 92 4 6 82 66Output:6
问题分析:
通过分析,我们可以找到其中消除的规律,从消除的第二行开始,每次记录好最左侧的元素值,直到最后剩余一个元素,那么这个最左侧元素值即为答案。
过程详见代码:
class Solution {public: int lastRemaining(int n) { if (n == 1) return 1;if (n <= 3) return 2;int row = 1, left = 2, num = n / 2;while (num > 1){if (row % 2 == 1){if(num % 2 == 1) left = left + (int)pow(2,row);}else{left = left + (int)pow(2, row);}row++;num = num / 2;}return left; }};
阅读全文
0 0
- Elimination Game问题及解法
- Nim Game问题及解法
- Jump Game问题及解法
- Baseball Game问题及解法
- Game of Life问题及解法
- Elimination Game
- Elimination Game
- Elimination Game
- 390. Elimination Game
- [LeetCode] 390. Elimination Game
- 390. Elimination Game
- 390. Elimination Game
- LeetCode 390. Elimination Game
- 390. Elimination Game
- 【LeetCode】390. Elimination Game
- 390. Elimination Game
- 【LeetCode】 390. Elimination Game
- 390. Elimination Game
- Laravel 5.5设置跨域访问
- 数据库——Oracle中常见的日期类型及日期函数
- spring mvc项目从简入奢全过程记录(二):最简明的MVC
- Hadoop/Spark推荐系统(四)——推荐链接
- LeetCode.143 Reorder List
- Elimination Game问题及解法
- 【实战】2-4Linux上JDK,Tomcat,Maven安装配置(centOS,阿里云)
- python解方程
- html5学习笔记2 html简介
- Unable to load image ntoskrnl.exe的问题
- 类比C++ 学习Python的class
- WEB_01_HTML概述
- Monkeyrunner--自动化测试工具
- macos下java版本动态切换