[問題] 一串數字中找到相同的兩個數
問題:
給定n個數(不限整數或浮點數,也不限上下界),
如果已知其中僅有兩個數相等,
要如何找到這兩個數呢?
我只想得到先sort後再找,
但這樣感覺多做了很多事情,
請問有沒有低於O(nlogn)、最好是O(n)的做法呢?
感謝!
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 1.162.91.142
※ 文章網址: http://www.ptt.cc/bbs/Prob_Solve/M.1417440347.A.3F4.html
推
12/01 21:42, , 1F
12/01 21:42, 1F
→
12/01 23:08, , 2F
12/01 23:08, 2F
→
12/01 23:08, , 3F
12/01 23:08, 3F
推
12/02 23:39, , 4F
12/02 23:39, 4F
→
12/02 23:39, , 5F
12/02 23:39, 5F
→
12/03 16:26, , 6F
12/03 16:26, 6F
推
12/04 03:15, , 7F
12/04 03:15, 7F
推
12/04 14:54, , 8F
12/04 14:54, 8F
→
12/04 14:55, , 9F
12/04 14:55, 9F
推
12/07 11:47, , 10F
12/07 11:47, 10F
→
12/07 11:47, , 11F
12/07 11:47, 11F
→
12/07 11:50, , 12F
12/07 11:50, 12F
→
12/09 02:16, , 13F
12/09 02:16, 13F
推
12/09 12:26, , 14F
12/09 12:26, 14F
→
12/09 12:27, , 15F
12/09 12:27, 15F
→
12/09 12:30, , 16F
12/09 12:30, 16F
→
12/17 18:48, , 17F
12/17 18:48, 17F