- XOR makes it zero if it is the same number; that is not removing the number, just making it
0
(maybe useful if zero is not allowed, but still it is not removed)
Example: entering 1
, 1
will result in having [1, 0, ...]
in the array
- XOR makes a (total) different number if it is not the same number
Example: entering 1
and 2
will result in having [1, 3 ,...]
in the array
- that algorithm only compares the entered value with the last entry of the array, not testing against any previous entry
Example: entering 1
, 2
, 1
will result in having [1, 2, 1, ...]
in the array
Answer: it may even be possible, but I don't think it is simple neither to implement nor to understand
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…