/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
ListNode toollinklist = head;
while(toollinklist!=null && toollinklist.next!=null){
if(toollinklist.val == toollinklist.next.val){
//简单的单链表删除操作 将该结点指向该结点的下下个结点(即断开与中间结点的连接,即删除中间结点)
toollinklist.next = toollinklist.next.next;
}else{
toollinklist = toollinklist.next;
}
}
return head;
}
}