can be done in linear time...

來源: 於 2009-05-18 19:42:41 [舊帖] [給我悄悄話] 本文已被閱讀：次

find i such that a[i] != i

Let us assume i = 1

a[1], a[a[1]], ..., a^{n}[1] can be viewed as a single linked list...

2x chase...