def removeDuplicates(llist): # Write your code here var=llist while var: if var.next and var.data == var.next.data: var.next = var.next.next else: var = var.next return llist

python

def removeDuplicates(llist): # Write your code here temp=llist while temp and temp.next: if(temp.data==temp.next.data): delnode=temp.next temp.next=temp.next.next del delnode else: temp=temp.next return llist

def removeDuplicates(llist): current=llist while current: if current.next and current.data == current.next.data: current.next = current.next.next else: current = current.next

return llist

You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty.

Example

refers to the first node in the list .

Remove 1 of the data values and return pointing to the revised list .

Function Description

Complete the removeDuplicates function in the editor below.

removeDuplicates has the following parameter:

SinglyLinkedListNode pointer head: a reference to the head of the list Returns

SinglyLinkedListNode pointer: a reference to the head of the revised list

go

func removeDuplicates(llist *SinglyLinkedListNode) *SinglyLinkedListNode { myMap := make(map[int32]int32)

dump := llist
before := llist
for (dump != nil) {
    _, exists := myMap[dump.data]
    if exists {
        before.next = dump.next
        dump = dump.next
    } else {
        myMap[dump.data] = 1
        before = dump
        dump = dump.next
    }
}

return llist

}