390. Elimination Game
来源:互联网 发布:淘宝买苹果手机靠谱吗 编辑:程序博客网 时间:2024/06/04 19:57
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.
Example:
Input:n = 9,1 2 3 4 5 6 7 8 92 4 6 82 66Output:6
摘自
https://discuss.leetcode.com/topic/59293/java-easiest-solution-o-logn-with-explanation
public int lastRemaining(int n) { boolean left = true; int remaining = n; int step = 1; int head = 1; while (remaining > 1) { if (left || remaining % 2 ==1) { head = head + step; } remaining = remaining / 2; step = step * 2; left = !left; } return head; }
My idea is to update and record head in each turn. when the total number becomes 1, head is the only number left.
When will head be updated?
- if we move from left
- if we move from right and the total remaining number % 2 == 1
like 2 4 6 8 10, we move from 10, we will take out 10, 6 and 2, head is deleted and move to 4
like 2 4 6 8 10 12, we move from 12, we will take out 12, 8, 4, head is still remaining 2
then we find a rule to update our head.
example:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
Let us start with head = 1, left = true, step = 1 (times 2 each turn), remaining = n(24)
we first move from left, we definitely need to move head to next position. (head = head + step)
So after first loop we will have:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 - > 2 4 6 8 10 12 14 16 18 20 22 24
head = 2, left = false, step = 1 * 2 = 2, remaining = remaining / 2 = 12second loop, we move from right, in what situation we need to move head?
only if the remaining % 2 == 1, in this case we have 12 % 2 == 0, we don't touch head.
so after this second loop we will have:
2 4 6 8 10 12 14 16 18 20 22 24 - > 2 6 10 14 18 22
head = 2, left = true, step = 2 * 2 = 4, remaining = remaining / 2 = 6third loop, we move from left, move head to next position
after third loop we will have:
2 6 10 14 18 22 - > 6 14 22
head = 6, left = false, step = 4 * 2 = 8, remaining = remaining / 2 = 3fourth loop, we move from right, NOTICE HERE:
we have remaining(3) % 2 == 1, so we know we need to move head to next position
after this loop, we will have
6 14 22 - > 14
head = 14, left = true, step = 8 * 2 = 16, remaining = remaining / 2 = 1while loop end, return head
- 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
- 390. Elimination Game
- LeetCode 390. Elimination Game
- [leetcode]390. Elimination Game
- 390. Elimination Game
- [LeetCode]390. Elimination Game
- LeetCode 390. Elimination Game
- [leetcode] 390. Elimination Game
- 390. Elimination Game
- windows service程序的入门范例(三)——真正好用的实战例子
- Linux下文件编程简介
- linux下添加用户并赋予root权限
- 深入解析 ObjC 中方法的结构
- Android实用代码片段整合
- 390. Elimination Game
- RSA private key file not found
- 接口回调
- .gitignore无效,不能过滤某些文件
- android-filepicker
- laravel框架怎么设置公共头和公共尾
- BZOJ 3832 [Poi2014]Rally
- icon-font 图标字体的使用
- maven Settings配置文件详解