题目描述:
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
给定一个数组,先从左到右隔一个数删除一个数,然后从右往左隔一个数删除一个数,不断循环求最后剩余的数。这道题直接按照游戏步骤去删除元素,时间复杂度肯定很高,可以观察发现规律,相对于原数组,第一次是灭两个数删除一个数,第二次是每四个数删除一个数,以此类推。所以定义一个变量gap表示需要隔多少个数才能删除一个数,在定义一个变量begin表示剩余数中的第一个数,从左往右删除必然删除第一个数,从右往左删除时,如果有奇数个数就不会删除掉第一个数,按照这个规律不断迭代,直到只剩一个数的时候,返回begin。
class Solution {
public:
int lastRemaining(int n) {
int begin=1;
int gap=1;
while(n/gap>=2)
{
begin+=gap;
gap*=2;
if(n/gap==1) break;
if((n/gap)%2==1) begin+=gap;
gap*=2;
}
return begin;
}
};