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

>>阅读原文<<