j*****k
发帖数: 1198 | 1 【 以下文字转载自 JobHunting 讨论区 】
发信人: jobseek (seeking+jobs), 信区: JobHunting
标 题: algorithm interview question help
发信站: BBS 未名空间站 (Wed Sep 29 23:59:08 2010, 美东)
There is one unknow integer in range (0, 10000).
Develop an algorithm to find it. The algorithm
should be faster than binary search. The faster,
the better. | g**e
发帖数: 6127 | 2 set one number b to max int, xor twice with the unknown number you can get
the answer
【在 j*****k 的大作中提到】
: 【 以下文字转载自 JobHunting 讨论区 】
: 发信人: jobseek (seeking+jobs), 信区: JobHunting
: 标 题: algorithm interview question help
: 发信站: BBS 未名空间站 (Wed Sep 29 23:59:08 2010, 美东)
: There is one unknow integer in range (0, 10000).
: Develop an algorithm to find it. The algorithm
: should be faster than binary search. The faster,
: the better.
| j*****k
发帖数: 1198 | 3 能不能说具体点？
谢谢
【在 g**e 的大作中提到】
: set one number b to max int, xor twice with the unknown number you can get
: the answer
|
|
