/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} head
* @return {ListNode}
*/
var deleteDuplicates = function(head) {
if(!head){ //判断是否为空
return head
}
//创建一个链表
const newNode = new ListNode(0,head)
//循环判断 当前节点的下一个和下下个节点是否相同,如果是,就全部跳过
while(newnode.next && newnode.next.next){
if(newnode.next.val === newnode.next.next.val){
const x = newnode.next.val
while(newnode.next && newnode.next.val === x){
newnode.next = newnode.next.next
}
}else{
newnode = newnode.next
}
}
return newNode.next
};