Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3. 
本文共 221 字，大约阅读时间需要 1 分钟。
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.
转载于:https://www.cnblogs.com/yangscode/p/5032458.html