Given an array of n-2 unique numbers in range 1 to n (inclusive). I want to find the missing two numbers in the array using xor. Please help me providing the idea. Thanks in advance.
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Name |
---|
May I wrong...
Maximum you may get : xor of missing two numbers. But xor of different numbers may be equal. See http://rextester.com/BBMAI41221 , so I think that you cannot find this two numbers from XOR operation.
Let your's missing numbers 2*m , and 2*m + 1, but for any m : (2*m) XOR (2*m+1) = 1. How you can find they??
Why you do not use simplist way:
bool visit[n]
array )) ? It's O(n) algo, and O(n) memory.