-
Notifications
You must be signed in to change notification settings - Fork 4.9k
/
EliminationGame.cpp
41 lines (39 loc) · 1.13 KB
/
EliminationGame.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
// Source : https://leetcode.com/problems/elimination-game
// Author : Hao Chen
// Date : 2016-09-07-
/**********************************************************************************
*
* 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 9
* 2 4 6 8
* 2 6
* 6
*
* Output:
* 6
**********************************************************************************/
class Solution {
public:
int lastRemaining(int n) {
int start = 1, step = 1;
while (n > 1) {
start += step + (n-2)/2 * 2*step;
n /= 2;
step *= -2;
}
return start;
}
};