a similar but harder problem

一个数组有n+1个数，都在1到n之间，并且每个数至少出现一次（有一个数重复了），找出那个重复的数（只能用constant memory）。

所有跟帖： 

• sum mod n -haha2000- ♂ (0 bytes) () 05/18/2009 postreply 09:52:57

• I asked a similar question in an interview. -乱弹- ♂ (162 bytes) () 05/18/2009 postreply 10:01:54

• you are definitely right... I need to fix it :) -dynamic- ♂ (0 bytes) () 05/18/2009 postreply 10:48:03

• fix of the problem -dynamic- ♂ (160 bytes) () 05/18/2009 postreply 10:51:26

• algorithmic complexity requirement? -haha2000- ♂ (103 bytes) () 05/18/2009 postreply 19:19:21

• can be done in linear time... -haha2000- ♂ (150 bytes) () 05/18/2009 postreply 19:42:41

• it takes a bit more than that -dynamic- ♂ (438 bytes) () 05/18/2009 postreply 19:55:29

• hmm，这个有意思：） -戏雨飞鹰- ♀ (0 bytes) () 05/18/2009 postreply 21:12:19

• 回复：it takes a bit more than that -utopian- ♂ (51 bytes) () 05/20/2009 postreply 17:23:11

• hashing needs linear memory as well. we want constant memory her -dynamic- ♂ (0 bytes) () 05/20/2009 postreply 17:28:12

• Pay attention to some key numbers. -乱弹- ♂ (0 bytes) () 05/20/2009 postreply 19:24:24

• 觉得在哪里见过这个题目 -haha2000- ♂ (19 bytes) () 05/21/2009 postreply 07:24:10

• I don't think so. -乱弹- ♂ (0 bytes) () 05/21/2009 postreply 09:52:29

• 这题目是IMB ２００４ 一月的一个puzzle：） -戏雨飞鹰- ♀ (79 bytes) () 05/21/2009 postreply 12:22:12

• Yes, right! thanks! -haha2000- ♂ (0 bytes) () 05/22/2009 postreply 11:05:23

• solution -dynamic- ♂ (572 bytes) () 05/20/2009 postreply 21:41:18

• hmmm，佩服. "形状像一个勺子", haha... -戏雨飞鹰- ♀ (0 bytes) () 05/21/2009 postreply 12:25:03

• 这个题目曾是微软的面试题目。但是没有了数组'read only'的条件， -戏雨飞鹰- ♀ (75 bytes) () 05/21/2009 postreply 13:12:13