Linked List, Hash Table, Two Pointers [linked list cycle]

Use a hash table to check whether a node had been visited before. go through 每一個node, 在hash table裏 記錄node's reference 或者 memory address。如果當前的node 是null， 那麼我們就到達了the end of the list, 並且 這個list must not

>>阅读原文<<