Find three numbers appeared only once using bit manipulation
Posted
by shilk
on Stack Overflow
See other posts from Stack Overflow
or by shilk
Published on 2010-06-09T04:02:56Z
Indexed on
2010/06/09
4:12 UTC
Read the original article
Hit count: 413
bit-manipulation
|bit
In a sequence of length n, where n=2k+3, that is there are k unique numbers appeared twice, how to find the three unique numbers that appeared only once using bit manipulation? for example, in sequence 1 1 2 6 3 6 5 7 7 the three unique numbers are 2 3 5.
© Stack Overflow or respective owner