@footy, I apologies, and I didn't realize the fact that some numbers might be zero, thanks!

bad algorithm, the better way is to multiply all number in array, then divide the number in current index to calculate the result. This is a algorithm question, and I don't think the interviewer will really focus on your coding style.

The code looks good.

you cannot merge it go a single if.

I think I understand your code now, you are right! but I have another version with a little difference, we can save a pointer, please see my answer.

OK, take an unsorted list for example, 1->1->2->1->3->2->2->3, you code want to get a result of 1->2->3, right?

It seems your method only remove the adjacent duplicate elements. is that the case?