Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,
Given 1->2->3->3->4->4->5
, return 1->2->5
.
Given 1->1->1->2->3
, return 2->3
.
这道题跟Remove Duplicates from Sorted List 的区别在于此题需要将重复的结点全部删掉,而且重复的结点不只两个,而是两个以上,解决此问题在于当探测到两个结点相同时需要在此处循环删除后面结点数值域与第一个结点数值域相同的结点;
代码如下: