[第二轮] 2/25-3/3 CareerCup 2.1

Write code to remove duplicates from an unsorted linked list.
FOLLOW UP
How would you solve this problem if a temporary buffer is not allowed?

发帖规范:
http://www.1point3acres.com/bbs/thread-48094-1-1.html
http://www.1point3acres.com/bbs/thread-32423-1-1.html

我的代码。https://gist.github.com/4fffc35734f2223f4199.git
我看到有很多种实现方法，链表和结点分成两个类，或者结点定义成链表的内部类，还有的是只定义了结点类，哪一种比较好呢？如果将两个类分开，属性又是private，那么想在在类外使用属性就要定义很多个设置或获取属性的方法，这样感觉很麻烦啊！

1. with temp buffer, by using hashSet (no duplicate elements allowed) o(N)
2. set up 2 pointer check all the elements. O(n^2)

https://gist.github.com/mazl123321/5022668

其他方法同楼上，补充一个递归方法的练练手。
链表中所有元素均不相等时，max run time O(N^2), 所有元素均相等时， min run time O(N)。
用递归方法实现，应该也算用了temporary buffer 吧？
https://gist.github.com/Zuohr/5022756

https://gist.github.com/ThunderXu/5023278
With Buffer: use a hash_set to record value that already appeared and delete them when they appear again in the linked list
Without Buffer: use a pointer to traverse the linked list and use another pointer to check all values behind of the current value in the process of iterating, if equal than delete

https://gist.github.com/njcongtou/4998427

1. O(n) use hashset to check existence.
2. O(n^2)

1. use set
2. pointer with no buffer
https://gist.github.com/chrislukkk/5036595

https://github.com/quantumrose/C ... 2.1.DeleteDups.java

https://gist.github.com/mettaworld/5027747
Java language
use the function random to generate data in linked list, and then search and delete the nodes with repeated data in a loop.

C language: https://gist.github.com/hukun01/5035548

Fanyare 发表于 2013-2-25 09:26
https://github.com/quantumrose/CareerCup/blob/master/2.1.DeleteDups.java

你觉得按题目要求，怎么样才算是不使用 temporary buffer 啊？我觉得临时变量也算 temporary buffer，但是不用不行