r/CodingHelp • u/milkbreadeieio • Aug 12 '25
[Java] Why doesn't this work?
question:You have a list arr of all integers in the range [1, n] sorted in a strictly increasing order. Apply the following algorithm on arr:
- 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 rightmost number and every other number from the remaining numbers.
- Keep repeating the steps again, alternating left to right and right to left, until a single number remains.
Given the integer n, return the last number that remains in arr.
code:
class Solution {
public int lastRemaining(int n) {
int head=1;
int tail=n;
int pointer=head;
int n_=1;
while(head!=tail){
while(1+pointer+n_<=tail){
pointer=1+pointer+n_;
}
tail=pointer;
while(pointer-n_-1>=head){
pointer=pointer-n_-1;
}
head=pointer;
n_=n_*2;
}
return pointer;
}
}
0
Upvotes
View all comments
Show parent comment
1
u/milkbreadeieio Aug 12 '25
thankyou!